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 条
  • [21] Reachability in Petri Nets with Inhibitor Arcs
    Reinhardt, Klaus
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 223 : 239 - 264
  • [22] Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings
    Alex Kondratyev
    Michael Kishinevsky
    Alexander Taubin
    Sergei Ten
    Formal Methods in System Design, 1998, 12 : 5 - 38
  • [23] Reachability Analysis for a Class of Petri Nets
    Ru, Yu
    Hadjicostis, Christoforos N.
    PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 1261 - 1266
  • [24] Diagnosis Using Unfoldings of Parametric Time Petri Nets
    Grabiec, Bartosz
    Traonouez, Louis-Marie
    Jard, Claude
    Lime, Didier
    Roux, Olivier H.
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2010, 6246 : 137 - +
  • [25] Calculating place capacity for Petri nets using unfoldings
    Miyamoto, T
    Kumagai, S
    1998 INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 1998, : 143 - 151
  • [26] Analysis of Petri Nets by ordering relations in reduced unfoldings
    Kondratyev, A
    Kishinevsky, M
    Taubin, A
    Ten, S
    FORMAL METHODS IN SYSTEM DESIGN, 1998, 12 (01) : 5 - 38
  • [27] Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
    Chatain, Thomas
    Fabre, Eric
    APPLICATIONS AND THEORY OF PETRI NETS, PROCEEDINGS, 2010, 6128 : 165 - +
  • [28] On the Semantics of Petri Nets: Processes, Unfoldings and Infinite Computations
    Sassone, V.
    Bulletin of the European Association for Theoretical Computer Science, 1994, (53):
  • [29] A symbolic reachability graph for coloured petri nets
    Chiola, G
    Dutheillet, C
    Franceschinis, G
    Haddad, S
    THEORETICAL COMPUTER SCIENCE, 1997, 176 (1-2) : 39 - 65
  • [30] New Reachability Trees for Unbounded Petri Nets
    Wang, ShouGuang
    Zhou, MengChu
    Gan, MengDi
    You, Dan
    Li, Yue
    2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 3862 - 3867
12345