An algorithm for Petri nets reachability by unfoldings

被引：0
|
作者：
Miyamoto, T [1 ]
Nakano, S
Kumagai, S
机构：
[1] Osaka Univ, Dept Elect Engn, Suita, Osaka 5650871, Japan
[2] Sharp Corp, Tenri, Nara 6320004, Japan
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 1999年 / E82A卷 / 03期
关键词：
Petri nets; unfoldings; reachability; avoidance of state space explosion;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.
引用
收藏
页码：500 / 503
页数：4
相关论文
共 50 条
  • [1] Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
    Novosad, Petr
    Ceska, Milan
    [J]. COMPUTER AIDED SYSTEMS THEORY, PT 1, 2013, 8111 : 428 - 435
  • [2] An Algorithm to Construct Concurrent Reachability Graph of Petri Nets
    张金泉
    倪丽娜
    蒋昌俊
    [J]. Journal of Donghua University(English Edition), 2004, (03) : 180 - 184
  • [3] Finite unfoldings of unbounded Petri nets
    Desel, J
    Juhás, G
    Neumair, C
    [J]. APPLICATIONS AND THEORY OF PETRI NETS 2004, PROCEEDINGS, 2004, 3099 : 157 - 176
  • [4] Verifying CTL with Unfoldings of Petri Nets
    Dong, Lanlan
    Liu, Guanjun
    Xiang, Dongming
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2018, PT IV, 2018, 11337 : 47 - 61
  • [5] Unfoldings of Bounded Hybrid Petri Nets
    Novosad, Petr
    Ceska, Milan
    [J]. COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2011, PT I, 2012, 6927 : 543 - 550
  • [6] On persistent reachability in Petri nets
    Barylska, Kamila
    Mikulski, Lukasz
    Ochmanski, Edward
    [J]. INFORMATION AND COMPUTATION, 2013, 223 : 67 - 77
  • [7] On reachability graphs of Petri nets
    Ye, XM
    Zhou, HT
    Song, XY
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2003, 29 (02) : 263 - 272
  • [8] Compositional reachability in petri nets
    Rathke, Julian
    Sobociński, Pawell
    Stephens, Owen
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8762 : 230 - 243
  • [9] A reachability algorithm for general Petri nets based on transition invariants
    Kostin, Alexander E.
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 608 - 621
  • [10] Deadlock prevention using Petri nets and their unfoldings
    A. Taubin
    A. Kondratyev
    M. Kishinevsky
    [J]. The International Journal of Advanced Manufacturing Technology, 1998, 14 : 750 - 759
12345