Some observations on supervisory policies that enforce liveness in partially controlled Free-choice Petri nets

Mathematics and Computers in Simulation

Volumn 70, Issue 5-6, 2006, Pages 266-274

  Sreenivas, Ramavarapu S ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Petri nets; Supervisory control

Indexed keywords

PETRI NETS; PUBLIC POLICY;

FREE-CHOICE PETRI NET (FCPN); SUPERVISORY POLICIES; SUPERVISORY SYNTHESIS PROBLEM;

SUPERVISORY AND EXECUTIVE PROGRAMS;

EID: 32144443878     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.matcom.2005.11.002     Document Type: Conference Paper

References (17)

1. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
2. M.H.T. Hack Analysis of production schemata by Petri nets. Master's thesis, Massachusetts Institute of Technology, February 1972.
3. K.X. He, and M.D. Lemmon Liveness-enforcing supervision of bounded ordinary petri nets using partial order methods IEEE Trans. Autom. Control 47 7 2002 1042 1055
4. K.X. He, and M.D. Lemmon Author's reply to "Comments on "Liveness-enforcing supervision of bounded ordinary petri nets using partial order methods" " IEEE Trans. Autom. Control 49 7 2004 1220
5. M.V. Iordache, P.J. Antsaklis, Generalized Conditions for Liveness Enforcement and Deadlock Prevention in Petri Nets, vol. 2075, LNCS, Springer-Verlag, 2001, pp. 184-203
6. N.D. Jones, L.H. Landweber, and Y.E. Lien Complexity of some problems in Petri nets Theor. Comput. Sci. 4 1977 277 299
7. H. Lewis, C.H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall, NY, 19851.
8. J.O. Moody, and P.J. Antsaklis Supervisory Control of Discrete Event Systems using Petri Nets 1998 Kluwer Academic Publishers
9. T. Murata Petri nets: properties, analysis and applications Proc. IEEE 77 4 1989 541 580
10. J. Park, S. Reveliotis, A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings, in: Proceedings of the IEEE International Conference on Decision and Control, Sydney, Australia, December 2000, pp. 2663-2669.
11. J.L. Peterson Petri Net Theory and the Modeling of Systems 1981 Prentice-Hall Englewood Cliffs, NJ
12. W. Reisig Petri Nets 1985 Springer-Verlag Berlin
13. R.S. Sreenivas On Commoner's liveness theorem and supervisory policies that enforce liveness in free-choice petri Syst. Control Lett. 31 1997 41 48
14. R.S. Sreenivas On the existence of supervisory policies that enforce liveness in discrete event dynamic systems modeled by controlled Petri nets IEEE Trans. Autom. Control 42 7 1997 928 945
15. R.S. Sreenivas, On a minimally restrictive supervisory policy that enforces liveness in partially controlled free choice petri nets, in: Proceedings of the Conference on Decision and Control (CDC-2000), Sydney, Australia, December 2000.
16. R.S. Sreenivas, On partially controlled free choice petri nets, in: Proceedings of the International Workshop on Discrete Event Systems (WODES-2000), Ghent, Belgium, August 2000.
17. X. Xie, and A. Giua Counterexamples to "Liveness-enforcing supervision of bounded ordinary petri nets using partial order methods" IEEE Trans. Autom. Control 49 7 2004 1217 1219