On the liveness problem of 1-place-unbounded petri nets

被引：0
|
作者：
Jeng, MD
Peng, MY
机构：
来源：
SMC '97 CONFERENCE PROCEEDINGS - 1997 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: CONFERENCE THEME: COMPUTATIONAL CYBERNETICS AND SIMULATION | 1997年
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
An augmented teachability tree (ART) is proposed to extend the ability of the classical teachability tree for solving the liveness problem of a class of Petri nets where there exists at most one unbounded place. The idea is based on the computation of the minimal token number of the unbounded place. An algorithm for obtaining the minimal token number is shown. Examples are given to illustrate the technique. The proposed method can also be used to solve the shortest path problem in graphs with negative costs.
引用
收藏
页码：3221 / 3226
页数：6
相关论文
共 50 条
  • [41] A resource configuration method for liveness of a class of Petri nets
    Liu, Miao
    Wang, ShouGuang
    Hayat, Tasawar
    Alsaedi, Ahmed
    Li, ZhiWu
    IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION, 2016, 33 (04) : 933 - 950
  • [42] Observable liveness of Petri nets with controllable and observable transitions
    Guanjun LIU
    Changjun JIANG
    Science China(Information Sciences), 2017, 60 (11) : 256 - 264
  • [43] On Liveness Enforcing Supervisory Policies for Arbitrary Petri Nets
    Chen, Chen
    Raman, Arun
    Hu, Hesuan
    Sreenivas, Ramavarapu S.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (12) : 5236 - 5247
  • [44] Observable liveness of Petri nets with controllable and observable transitions
    Liu, Guanjun
    Jiang, Changjun
    SCIENCE CHINA-INFORMATION SCIENCES, 2017, 60 (11)
  • [45] A polynomial algorithm to decide the liveness for a class of Petri nets
    Li, Zhiwu
    Liu, Ding
    Wang, Anrong
    PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, 2006, : 254 - 259
  • [46] Liveness enforcing monitors for safe and controllable Petri nets
    Lemmon, MD
    He, KX
    PROCEEDINGS OF THE 41ST IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 2002, : 775 - 780
  • [47] Model Checking of ω-Independent Unbounded Petri Nets for an Unbounded System
    Wang, Shuo
    Yang, Ru
    Yu, Wangyang
    Ding, Zhijun
    Jiang, Changjun
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024,
  • [48] PLACE BISIMULATIONS IN PETRI NETS
    AUTANT, C
    SCHNOEBELEN, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 25 - 61
  • [49] 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
  • [50] 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
12345