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 条
  • [1] Complex Reachability Trees and Their Application to Deadlock Detection for Unbounded Petri Nets
    Lu, Faming
    Zeng, Qingtian
    Zhou, MengChu
    Bao, Yunxia
    Duan, Hua
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2019, 49 (06): : 1164 - 1174
  • [2] 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
  • [3] 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
  • [4] Augmented reachability trees for 1-place-unbounded generalized Petri nets
    Jeng, MD
    Peng, MY
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1999, 29 (02): : 173 - 183
  • [5] ONE-PLACE UNBOUNDED STOCHASTIC PETRI NETS - ERGODIC CRITERIA AND STEADY-STATE SOLUTIONS
    FLORIN, G
    NATKIN, S
    JOURNAL OF SYSTEMS AND SOFTWARE, 1986, 6 (1-2) : 103 - 115
  • [6] New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets
    Shouguang WANG
    Dan YOU
    Mengchu ZHOU
    Science China(Information Sciences), 2018, 61 (12) : 193 - 195
  • [7] New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets
    Wang, Shouguang
    You, Dan
    Zhou, Mengchu
    SCIENCE CHINA-INFORMATION SCIENCES, 2018, 61 (12)
  • [8] New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets
    Shouguang Wang
    Dan You
    Mengchu Zhou
    Science China Information Sciences, 2018, 61
  • [9] An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees
    You, Dan
    Wang, Shouguang
    Wu, Wenhui
    IEEE ACCESS, 2018, 6 : 43732 - 43742
  • [10] A modified reachability tree approach to analysis of unbounded Petri nets
    Wang, FY
    Gao, YQ
    Zhou, MC
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (01): : 303 - 308
12345