A polynomial-complexity approach to decide the existence of a maximally permissive Petri net supervisor using elementary siphons

liveness is usually enforced by designing a supervisor that is supervisory in nature disabling events which otherwise would lead to the violation of the liveness specification. The supervisor is theoretically and practically expected to be maximally permissive such that it restricts the behavior of the plant (system under control) in a least restrictive manner while the liveness specification is not violated. However, the existence of a supervisory policy that enforces liveness in an arbitrary Petri net is undecidable. Based on elementary siphons of Petri nets, we develop a polynomial complexity approach to decide the existence of a maximally permissive monitorbased liveness-enforcing Petri net supervisor for a subclass of Petri nets, S3PR that can well model a large class of flexible manufacturing systems. The results obtained in this paper are based on the computation of the set of elementary siphons and siphon composition operations in an S3PR in our previous work, which has been shown to be of polynomial complexity with respect to the size of an S3PR.

[1]  MengChu Zhou,et al.  On Siphon Computation for Deadlock Control in a Class of Petri Nets , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Spyros A. Reveliotis,et al.  On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems , 2003, ICATPN.

[3]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[4]  R. Sreenivas.  On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets , 1997, IEEE Trans. Autom. Control..

[5]  Panos J. Antsaklis,et al.  Feedback control of Petri nets based on place invariants , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[6]  MengChu Zhou,et al.  Two-Stage Method for Synthesizing Liveness-Enforcing Supervisors for Flexible Manufacturing Systems Using Petri Nets , 2006, IEEE Transactions on Industrial Informatics.

[7]  MengChu Zhou,et al.  Control of Elementary and Dependent Siphons in Petri Nets and Their Application , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[8]  Kurt Lautenbach,et al.  The Linear Algebra of Deadlock Avoidance - A Petri Net Approach , 1996 .

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

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

[11]  Nidhal Rezg,et al.  Design of a live and maximally permissive Petri net controller using the theory of regions , 2003, IEEE Trans. Robotics Autom..

[12]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[13]  Haoxun Chen,et al.  Deadlock avoidance policy for Petri-net modeling of flexible manufacturing systems with shared resources , 1996 .

[14]  Kamel Barkaoui,et al.  On Liveness and Controlled Siphons in Petri Nets , 1996, Application and Theory of Petri Nets.

[15]  Feng Chu,et al.  Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..

[16]  L. Recalde,et al.  A deadlock avoidance approach for non-sequential resource allocation systems , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[17]  B. Krogh,et al.  On closed-loop liveness of discrete event systems under maximally permissive control , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[18]  MengChu Zhou,et al.  Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems , 2004, IEEE Trans. Syst. Man Cybern. Part A.

[19]  Alessandro Giua,et al.  Generalized mutual exclusion contraints on nets with uncontrollable transitions , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[20]  Jonghun Park,et al.  Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems , 2000, IEEE Trans. Robotics Autom..

[21]  Yi-Sheng Huang.  Deadlock Prevention for Sequence Resource Allocation Systems , 2007, J. Inf. Sci. Eng..

[22]  MengChu Zhou,et al.  Clarifications on the Definitions of Elementary Siphons in Petri Nets , 2006, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[23]  Javier Martínez,et al.  A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[24]  Panos J. Antsaklis,et al.  Synthesis of deadlock prevention supervisors using Petri nets , 2002, IEEE Trans. Robotics Autom..

[25]  Murat Uzam,et al.  An Optimal Deadlock Prevention Policy for Flexible Manufacturing Systems Using Petri Net Models with Resources and the Theory of Regions , 2002 .

[26]  Huang Ke-di,et al.  A Deadlock Prevention Approach based on Atomic Transaction for Resource Co-allocation , 2005 .