Approach for minimal-siphon computation in S4PR

The efficient siphon computation is the key to the development of siphon-based deadlock control strategies with good performance. This work studies the computation of minimal siphons in a class of Petri nets called S4PR. Firstly, we propose a function with polynomial complexity to determine whether a resource subset can generate a minimal siphon. Next, using the technique of problem partitioning, a new approach is developed to compute all minimal siphons in S4PR. Finally, an example is given to illustrate the proposed approach.

[1]  Roberto Cordone,et al.  Combined Siphon and Marking Generation for Deadlock Prevention in Petri Nets , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  X. Xie,et al.  Siphon-Based Deadlock Prevention Policy for Flexible Manufacturing Systems , 2006, IEEE Trans. Syst. Man Cybern. Part A.

[3]  K. Barkaoui,et al.  A deadlock prevention method for a class of FMS , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[4]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[5]  MengChu Zhou,et al.  Computation of strict minimal siphons in a class of Petri nets based on problem decomposition , 2017, Inf. Sci..

[6]  MengChu Zhou,et al.  Synthesis of Monitor-Based Liveness-Enforcing Supervisors for $\rm{S}^{3}$ PR With ${\boldsymbol{\xi }}$ -Resources , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[7]  周孟初.  Synthesis of Monitor-based Liveness-Enforcing Supervisors for S3PR With ξ-Resources , 2015 .

[8]  Roberto Cordone,et al.  Enumeration algorithms for minimal siphons in Petri nets based on place constraints , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[9]  Erwin R. Boer,et al.  Generating basis siphons and traps of Petri nets using the sign incidence matrix , 1994 .

[10]  Elia E. Cano,et al.  An algorithm to compute the minimal siphons in S4PR nets , 2010, WODES.

[11]  Stéphane Lafortune,et al.  SAT-Based Control of Concurrent Software for Deadlock Avoidance , 2015, IEEE Transactions on Automatic Control.

[12]  MengChu Zhou,et al.  A Method to Compute Strict Minimal Siphons in a Class of Petri Nets Based on Loop Resource Subsets , 2012, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[13]  Fernando TricasJos,et al.  Using the incidence matrix in an evolutionary algorithm for Computing minimal siphons in Petri net models , 2014 .

[14]  Alessandro Giua,et al.  Complete enumeration of minimal siphons in ordinary Petri nets based on problem partitioning , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[15]  MengChu Zhou,et al.  Resource-Transition Circuits and Siphons for Deadlock Control of Automated Manufacturing Systems , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[16]  MengChu Zhou,et al.  A Necessary and Sufficient Condition for a Resource Subset to Generate a Strict Minimal Siphon in S 4PR , 2017, IEEE Transactions on Automatic Control.

[17]  MengChu Zhou,et al.  A Petri Net-Based Discrete-Event Control of Automated Manufacturing Systems With Assembly Operations , 2015, IEEE Transactions on Control Systems Technology.