On supervisory policies that enforce liveness in completely controlled Petri nets with directed cut-places and cut-transitions

IEEE Transactions on Automatic Control

Volumn 44, Issue 6, 1999, Pages 1221-1225

  Sreenivas, Ramavarapu S ^a  

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

Author keywords

DEDS; Liveness; Petri nets; Supervisory control

Indexed keywords

CONTROL SYSTEM ANALYSIS; PETRI NETS; SCADA SYSTEMS;

CUT-TRANSITION; DIRECTED CUT-PLACE; SUPERVISORY POLICIES;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0032670799     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.769378     Document Type: Article

References (10)

1. M. Ben-Ari, Principles of Concurrent Programming. Englewood Cliffs, NJ: Prentice-Hall, 1982.
2. N. Deo, Graph Theory with Applications to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1974.
3. T. Murata, "Petri nets: Properties, analysis and applications," Proc. IEEE, vol. 77, pp. 541-580, Apr. 1989.
4. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
5. P. J. G. Ramadge and W. M. Wonham, "The control of discrete event systems," Proc. IEEE, vol. 77, pp. 81-98, Jan. 1989.
6. W. Reisig, Petri Nets. Berlin, Germany: Springer-Verlag, 1985.
7. R. S. Sreenivas, "On the existence of supervisory policies that enforce liveness in discrete event dynamic systems modeled by controlled Petri nets," IEEE Trans. Automat. Contr., vol. 42, pp. 928-945, July 1996.
8. _, "On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets," Syst. Contr. Lett., vol. 31, pp. 41-48, 1997.
9. _, "On supervisory policies that enforce liveness in a class of completely controlled Petri nets obtained via refinement," IEEE Trans. Automat. Contr., 1997.
10. I. Suzuki and T. Murata, "A method for stepwise refinement and abstraction of Petri nets," J. Computer and Syst. Sci., vol. 27, pp. 51-76, 1983.