Deadlock checking for one-place unbounded Petri nets based on modified reachability trees

被引:32
|
作者
Ding, ZhiJun [1 ]
Jiang, ChangJun [2 ]
Zhou, MengChu [3 ,4 ]
机构
[1] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao 266510, Peoples R China
[2] Tongji Univ, Dept Comp Sci & Engn, Shanghai 201804, Peoples R China
[3] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
[4] Xidian Univ, Sch Electromech Engn, Xian 710071, Peoples R China
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS | 2008年 / 38卷 / 03期
关键词
automated manufacturing systems; deadlock; Petri net; reachability tree;
D O I
10.1109/TSMCB.2008.917177
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A deadlock-checking approach for one-place unbounded Petri nets is presented based on modified reachability trees (MRTs). An MRT can provide some useful information that is lost in a finite reachability tree, owing to MRT's use of the expression a + bn(j) rather than symbol omega to represent the value of the components of a marking. The information is helpful In property analysis of unbounded Petri nets. For the dead lock-checking purpose, this correspondence paper classifies full conditional nodes in MRT into two types: true and fake ones. Then, an algorithm is proposed to determine whether a full conditional node is true or not. Finally, a necessary and sufficient condition of deadlocks is presented. Examples are given to illustrate the method.
引用
收藏
页码:881 / 883
页数:3
相关论文
共 50 条
  • [41] Modified Rules for Modular Reachability Analysis of Petri Nets for Multiagent Systems
    Miyamoto, Toshiyuki
    2017 56TH ANNUAL CONFERENCE OF THE SOCIETY OF INSTRUMENT AND CONTROL ENGINEERS OF JAPAN (SICE), 2017, : 149 - 150
  • [42] Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs
    Gu, Chao
    Ma, Ziyue
    Li, Zhiwu
    AUTOMATICA, 2024, 164
  • [43] Comments on "Deadlock prevention policy based on Petri nets and siphons"
    Li, ZW
    Uzam, M
    Zhou, MC
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (24) : 5253 - 5254
  • [44] Conversion of 1-Place-Unbounded Synchronized Petri Nets into Weighted Automata
    Wu, Changshun
    Demongodin, Isabel
    Giua, Alessandro
    IFAC PAPERSONLINE, 2017, 50 (01): : 13434 - 13440
  • [45] A reachability algorithm for general Petri nets based on transition invariants
    Kostin, Alexander E.
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 608 - 621
  • [46] THE SYNTHESIS OF LOGICAL NETS WHOSE OPERATORS ARE DESCRIBED IN TERMS OF ONE-PLACE PREDICATE CALCULUS
    TRAHTENBROT, BA
    DOKLADY AKADEMII NAUK SSSR, 1958, 118 (04): : 646 - 649
  • [47] Deadlock analysis and control based on Petri nets: A siphon approach review
    Hou, YiFan
    Barkaoui, Kamel
    ADVANCES IN MECHANICAL ENGINEERING, 2017, 9 (05)
  • [48] Comparison of deadlock prevention policies in FMS based on Petri nets siphons
    Huang, YS
    Lin, JH
    Hsu, CN
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 4867 - 4872
  • [49] A Petri Nets Based Deadlock Avoidance Policy for Flexible Manufacturing Systems
    Wang, A. R.
    Li, Z. W.
    Jia, J. Y.
    IECON 2004: 30TH ANNUAL CONFERENCE OF IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOL 2, 2004, : 1896 - 1901
  • [50] Computation of synchronizing sequences for a class of 1-place-unbounded synchronized Petri nets
    Wu, Changshun
    Demongodin, Isabel
    Giua, Alessandro
    2018 5TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2018, : 51 - 57