Reachability criterion of live free choice Petri nets

被引：0
|
作者：
Matsumoto, T
机构：
来源：
APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96 | 1996年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Reachability problem is one of big issues in Petri net theory and it is reduced to that of free choice nets. However, a useful criterion has not been obtained for them. In this paper, some useful discussions on reachability of live free choice nets are presented; a net reduction method for a given net to the net with siphon/trap and a concept of immature siphon/trap are shown to judge the reachability of a given net.
引用
收藏
页码：350 / 353
页数：4
相关论文
共 50 条
  • [21] Reachability in Petri Nets with Inhibitor Arcs
    Reinhardt, Klaus
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 223 : 239 - 264
  • [22] 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
  • [23] On probabilistic diagnosis for free-choice Petri Nets
    Flochova, Jana
    Boel, Rene K.
    Jiroveanu, George
    2007 AMERICAN CONTROL CONFERENCE, VOLS 1-13, 2007, : 5541 - +
  • [24] Free-choice Petri nets - An algebraic approach
    Baccelli, F
    Foss, S
    Gaujal, B
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (12) : 1751 - 1778
  • [25] Optimal sensor choice for observability in Free-choice Petri Nets
    Aguirre-Salas, L
    Begovich, O
    Ramirez-Treviño, A
    PROCEEDINGS OF THE 2001 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL (ISIC'01), 2001, : 270 - 275
  • [26] 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
  • [27] 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
  • [28] A New Reachability Tree For Unbounded Petri Nets
    Li, Yue
    Wang, ShouGuang
    Yang, Jing
    2013 10TH IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), 2013, : 1296 - 1301
  • [29] The Reachability Problem for Petri Nets is Not Primitive Recursive
    Leroux, Jerome
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 1241 - 1252
  • [30] A survey of reachability trees of unbounded Petri nets
    Gan, Meng-Di
    Wang, Shou-Guang
    Zhou, Meng-Chu
    Li, Jun
    Li, Yue
    Zidonghua Xuebao/Acta Automatica Sinica, 2015, 41 (04): : 686 - 693
12345