Automated Synthesis of Deadlock Prevention Supervisors Using Petri Nets

Given an arbitrary Petri net structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear inequalities on the marking of a Petri net. When the Petri net is supervised so that its markings satisfy these inequalities, the supervised net is proved to be deadlock-free for all initial markings that satisfy the supervision constraints. Deadlock-freedom implies that there will always be at least one transition that is enabled in the closed loop (supervised) system. The method is not guaranteed to insure liveness, as it can be applied to systems that cannot be made live under any circumstances. However, it is shown that when the method does insure liveness, it is at least as permissive as any other liveness-insuring supervisor. Moreover, it is shown that the method is not too restrictive even for Petri nets in which not all transitions can be made live. The procedure allows automated synthesis of the supervisors. Based on this method we formulate and prove two extended methods with guaranteed termination and a method for maximally permissive deadlock prevention.

[1]  Stanislaw Walukiewicz.  Integer Programming , 1991 .

[2]  Maria Pia Fanti,et al.  Event-based feedback control for deadlock avoidance in flexible production systems , 1997, IEEE Trans. Robotics Autom..

[3]  Panos J. Antsaklis,et al.  Petri net supervisors for DES with uncontrollable and unobservable transitions , 2000, IEEE Trans. Autom. Control..

[4]  Panos J. Antsaklis,et al.  A Method for Deadlock Prevention in Discrete Event Systems Using Petri Nets , 1999 .

[5]  K. Lautenback.  Linear algebraic calculation of deadlocks and traps , 1987 .

[6]  Kamel Barkaoui,et al.  Deadlock avoidance in FMS based on structural theory of Petri nets , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[7]  Mark Lawley,et al.  Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems , 1997, IEEE Trans. Autom. Control..

[8]  M. Malik,et al.  Operating Systems , 1992, Lecture Notes in Computer Science.

[9]  A. Gurel,et al.  Analysis of deadlocks and circular waits using a matrix model for discrete event systems , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

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

[11]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[12]  Kurt Lautenbach,et al.  Liveness in Bounded Petri Nets Which Are Covered by T-Invariants , 1994, Application and Theory of Petri Nets.

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

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

[15]  Zbigniew Suraj.  A Resource Applocation Problem , 1980, MFCS.

[16]  Panos J. Antsaklis,et al.  A method for the synthesis of deadlock prevention controllers in systems modeled by Petri nets , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

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

[18]  René David,et al.  Petri nets for modeling of dynamic systems: A survey , 1994, Autom..

[19]  P. K. Sinha,et al.  Distributed Operating Systems: Concepts and Design , 1996 .

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

[21]  Ramavarapu S. Sreenivas.  An Application of Independent, Increasing, Free-Choice Petri Nets to the Synthesis of Policies that Enforce Liveness in Arbitrary Petri Nets , 1998, Autom..

[22]  Panos J. Antsaklis,et al.  Supervisory control of Petri nets with uncontrollable/unobservable transitions , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[23]  Panos J. Antsaklis,et al.  Supervisory Control of Discrete Event Systems Using Petri Nets , 1998, The International Series on Discrete Event Dynamic Systems.

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

[25]  Manuel Silva Suárez,et al.  A New Technique for Finding a Generating Family of Siphons, Traps and st-Components. Application to Colored Petri Nets , 1991, Applications and Theory of Petri Nets.

[26]  G. Nemhauser,et al.  Integer Programming , 2020 .

[27]  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..

[28]  Bruce H. Krogh,et al.  Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows , 1990, IEEE Trans. Robotics Autom..

[29]  P. Antsaklis,et al.  Reduced-order controllers for continuous and discrete-time singular H ∞ control problems based on LMI , 1996 .

[30]  Edsger W. Dijkstra,et al.  Cooperating sequential processes , 2002 .

[31]  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.

[32]  Arie Shoshani,et al.  System Deadlocks , 1971, CSUR.