On Deadlock/Livelock Studies Based on Reachability Graph of Petri Nets by Using TINA

被引:0
|
作者
Uzam, Murat [1 ]
Liu, Ding [2 ]
Berthomieu, Bernard [3 ]
Gelen, Gokhan [4 ]
Zhang, Zhaolong [2 ]
Mostafa, Almetwally M. [5 ]
Li, Zhiwu [6 ]
机构
[1] Yozgat Bozok Univ, Elekt Elekt Muhendisligi Bolumu, Muhendislik Mimarlik Fak, TR-66900 Yozgat, Turkiye
[2] Xidian Univ, Sch Electromech Engn, Xian 710071, Peoples R China
[3] Lab Anal & Architecture Syst Ctr Natl Rech Sci LAA, F-31077 Toulouse, France
[4] Bursa Tekn Univ, Mekatronik Muhendisligi Bolumu, Muhendislik & Doga Bilimleri Fak, TR-16310 Bursa, Turkiye
[5] King Saud Univ, Coll Comp & Informat Sci, Dept Informat Syst, Riyadh 1154, Saudi Arabia
[6] Macau Univ Sci & Technol, Inst Syst Engn, Taipa, Macau, Peoples R China
来源
IEEE ACCESS | 2024年 / 12卷
关键词
System recovery; Computational modeling; Frequency modulation; Analytical models; Prevention and mitigation; Petri nets; Production; Flexible manufacturing systems; Flexible manufacturing systems (FMS); deadlock; deadlock prevention; Petri Nets (PN); liveness enforcing supervisor (LES); PN computation tools; DEADLOCK PREVENTION POLICY; LIVENESS ENFORCING SUPERVISORS; FLEXIBLE MANUFACTURING SYSTEMS; ELEMENTARY SIPHONS;
D O I
10.1109/ACCESS.2024.3461168
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deadlock/livelock problems can cause catastrophic results in flexible manufacturing systems (FMS) by forcing them to stop production processes at an unpredictable stage of production. Therefore, they must be handled properly in order to obtain flawless production in FMS. Petri net (PN) based deadlock/livelock studies for FMS have been widely carried out to obtain live PN models. When a PN model is live, this ensures that the modelled FMS is deadlock-free. Firstly, an uncontrolled (plant) PN model is constructed for the FMS suffering from deadlocks/livelocks. Then reachability graph (RG) analysis of this PN model is carried out to provide all possible reachable states of the modelled system. An RG of a PN model of an FMS suffering from deadlock/livelock problems can be split into the live zone (LZ) and the deadlock zone (DZ). The former is the set of system states considered to be legal (good), while the latter is the set of system states regarded to be illegal (bad). The LZ represents the optimal (maximally permissive) system behavior that must be provided by an optimal control policy. Generally, in PN based liveness studies, a liveness enforcing supervisor (LES) consisting of a set of control places (CP) is computed. Then the controlled (closed-loop) PN model is obtained by merging the plant PN model and the LES. If the number of reachable live states of the controlled PN model is the same as the ones that exist in the LZ, then the controlled model is optimal. Otherwise, it is suboptimal. The greater the number of live reachable states of the RG, the more products to be produced within the FMS. Therefore, the number of reachable live states of the controlled PN model is considered as a quality measure. It defines the behavioral permissiveness of the controlled model. In the literature, to verify the behavioral permissiveness of the PN models, the PN tool called INA (Integrated Net Analyzer) has been widely used. Recently, by means of INA, a method was proposed to compute the number of states within the LZ and the DZ of a given PN model suffering from deadlocks/livelocks. Unfortunately, INA cannot compute RGs of large PNs having a few millions of states. Therefore, in this paper by means of TINA (TIme petri Net Analyzer), an alternative faster and much more efficient method is proposed for the computation of the number of states within the LZ and the DZ for PN models with large RGs. In addition, in order to enable the development of new PN based deadlock prevention methods, further computations are also proposed. These include the computation of the set of states in the DZ, LZ and first met bad markings (FBMs) for a given PN model suffering from deadlocks/livelocks. The applicability and the effectiveness of the proposed methods are demonstrated by considering several well-known examples of FMS from the relevant literature.
引用
收藏
页码:135506 / 135534
页数:29
相关论文
共 50 条
  • [1] SYNTHESIS OF DEADLOCK PREVENTION POLICY USING PETRI NETS REACHABILITY GRAPH TECHNIQUE
    Huang, Yi-Sheng
    Chung, Ta-Hsiang
    Su, Pin-June
    ASIAN JOURNAL OF CONTROL, 2010, 12 (03) : 336 - 346
  • [2] On near-optimal deadlock control for a class of generalized Petri nets using reachability graph
    Hou, YiFan
    Uzam, Murat
    Zhao, Mi
    Li, ZhiWu
    ENGINEERING COMPUTATIONS, 2017, 34 (06) : 1896 - 1922
  • [3] A reachability graph partitioning technique for the analysis of deadlock prevention methods in bounded Petri nets
    Fumagalli, Ivano
    Piroddi, Luigi
    Cordone, Roberto
    2010 AMERICAN CONTROL CONFERENCE, 2010, : 3365 - 3370
  • [4] 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
  • [5] Reachability graph for autonomous continuous Petri nets
    David, R
    Alla, H
    POSITIVE SYSTEMS, PROCEEDINGS, 2003, 294 : 63 - 70
  • [6] Hierarchical Reachability Graph Generation for Petri Nets
    Peter Buchholz
    Peter Kemper
    Formal Methods in System Design, 2002, 21 : 281 - 315
  • [7] Hierarchical reachability graph generation for Petri nets
    Buchholz, P
    Kemper, P
    FORMAL METHODS IN SYSTEM DESIGN, 2002, 21 (03) : 281 - 315
  • [8] Noninterference Analysis of Bounded Petri Nets Using Basis Reachability Graph
    Ran, Ning
    Nie, Jingyao
    Meng, Aiwen
    Seatzu, Carla
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (10) : 7159 - 7165
  • [9] Optimization of Consuming Resource Problem Based on Reachability Graph of Petri Nets
    Zhang Bo
    Qu Yizhi
    Ma Tao
    Li Peng
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 1745 - 1748
  • [10] 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