On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets

We consider discrete-state plants represented by controlled Petri nets (CtlPNs), where a subset of transitions can be prevented from firing by a supervisor. A transition in a CtlPN can fire at a marking if there are sufficient tokens in its input places and it is permitted to fire by the supervisor. A CtlPN is live if it is possible to fire any transition from every marking that is reachable under supervision. In this paper we derive a necessary and sufficient condition for the existence of a supervisory policy that enforces liveness in CtlPNs. We show this condition cannot be tested for an arbitrary CtlPN. However, for bounded CtlPNs or CtlPNs, where each transition is individually controllable, we show the existence of a supervisory policy which enforces that liveness is decidable. We also show the existence of a supervisory policy that enforces liveness is necessary and sufficient for the existence of a minimally restrictive supervisory policy.

[1]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[4]  W. M. Wonham,et al.  Supervisory control of discrete event processes , 1982 .

[5]  Mordechai Ben-Ari,et al.  Principles of concurrent programming , 1982 .

[6]  Ichiro Suzuki,et al.  A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..

[7]  Andrew S. Tanenbaum,et al.  Operating systems: design and implementation , 1987, Prentice-Hall software series.

[8]  Pravin M. Vaidya,et al.  An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1987, Math. Program..

[9]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[10]  P. Ramadge,et al.  Modular Feedback Logic for Discrete Event Systems , 1987 .

[11]  Gregory F. Sullivan,et al.  Detecting cycles in dynamic graphs in polynomial time , 1988, STOC '88.

[12]  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,.

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

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

[15]  Pravin M. Vaidya,et al.  An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1990, Math. Program..

[16]  C. Reutenauer.  The Mathematics of Petri Nets , 1990 .

[17]  Bruce H. Krogh,et al.  Synthesis of feedback control logic for a class of controlled Petri nets , 1990 .

[18]  Y. Narahari,et al.  Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models , 1990, IEEE Trans. Robotics Autom..

[19]  Xi-Ren Cao,et al.  Perturbation analysis of discrete event dynamic systems , 1991 .

[20]  B. Krogh,et al.  On closed-loop liveness of discrete-event systems under maximally permissive control , 1992 .

[21]  Gerald S. Shedler.  Regenerative Stochastic Simulation , 1992 .

[22]  S. Chung,et al.  Limited lookahead policies in supervisory control of discrete event systems , 1992 .

[23]  Edwin K. P. Chong,et al.  Discrete event systems: Modeling and performance analysis , 1994, Discret. Event Dyn. Syst..

[24]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[25]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.