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
相关论文
共 43 条
  • [31] Reachability Tree-Based Optimization Algorithm for Cyclic Scheduling of Timed Petri Nets
    Kim, Chulhan
    Yu, Tae-Sun
    Lee, Tae-Eog
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2021, 18 (03) : 1441 - 1452
  • [32] Web service composition verification based on symbol model checking and Petri nets
    Zhang, Shijie
    Xu, Peng
    Xu, Yang
    DEVELOPMENTS OF ARTIFICIAL INTELLIGENCE TECHNOLOGIES IN COMPUTATION AND ROBOTICS, 2020, 12 : 309 - 316
  • [33] Petri sub-nets for minpath-based fault trees
    Schneeweiss, WG
    ANNUAL RELIABILITY AND MAINTAINABILITY SYMPOSIUM, 2001 PROCEEDINGS, 2001, : 161 - 166
  • [34] Deadlock-Free Scheduling of Flexible Assembly Systems Based on Petri Nets and Local Search
    Luo, JianChao
    Liu, ZhiQiang
    Zhou, MengChu
    Xing, KeYi
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2020, 50 (10): : 3658 - 3669
  • [35] Extended elementary siphon-based deadlock prevention policy for a class of generalised Petri nets
    Hou, YiFan
    Li, ZhiWu
    Zhao, Mi
    Liu, Ding
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2014, 27 (01) : 85 - 102
  • [36] Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets
    Wu, Naiqi
    Zhou, MengChu
    OR SPECTRUM, 2007, 29 (03) : 421 - 443
  • [37] One-Step Look-Ahead Maximally Permissive Deadlock Control of AMS by Using Petri Nets
    Wu, Naiqi
    Zhou, Mengchu
    Hu, Gang
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2013, 12 (01)
  • [38] Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets
    Naiqi Wu
    MengChu Zhou
    OR Spectrum, 2007, 29 : 421 - 443
  • [39] On Multi-Step Look-Ahead Deadlock Prediction for Automated Manufacturing Systems Based on Petri Nets
    Lin, Rongfeng
    Yu, Zhenhua
    Shi, Xiaonan
    Dong, Lihong
    Nasr, Emad Abouel
    IEEE ACCESS, 2020, 8 : 170421 - 170432
  • [40] A Place-Timed Petri Net-Based Method to Avoid Deadlock and Conflict in Railway Networks
    Luo, Jianchao
    Zhou, Mengchu
    Wang, Jun-Qiang
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (08) : 10763 - 10772
12345