Linear control of live marked graphs

Automatica

Volumn 39, Issue 3, 2003, Pages 429-440

  Darondeau, Philippe ^a   Xie, Xiaolan ^b  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Firing vectors; Linear constraints; Linear programming; Liveness; Marked graphs; Polyhedra; Supervision

Indexed keywords

COMPUTATIONAL METHODS; CONTROL EQUIPMENT; GRAPH THEORY; LINEAR PROGRAMMING; VECTORS;

MARKED GRAPHS;

LINEAR CONTROL SYSTEMS;

EID: 0037363364     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(02)00266-2     Document Type: Article

References (16)

1. Chen H. Net structure and control logic synthesis of controlled Petri nets. IEEE Transactions on Automatic Control. 43(10):1998;1446-1451.
2. Chen H. Control synthesis of Petri nets based on. S -decreases Discrete Event Dynamic Systems. 10(3):2000;233-249.
3. Droste M., Shortt R.M. Bounded Petri nets of finite dimension have only finitely many reachable markings. Bulletin of the EATCS. 48:1992;172-175.
4. Giua, A., Di Cesare, F., & Silva, M. (1992). Generalized mutual exclusion constraints on nets with uncontrollable transitions. In Proceedings of the IEEE-SMC (pp. 974-979), Chicago, Illinois, USA.
5. Holloway L., Krogh B. On closed-loop liveness of discrete-event systems under maximally permissive control. IEEE Transactions on Automatic Control. 37(5):1992;692-697.
6. Iordache, M., Moody, J., & Antsaklis, P. (2001). A method for the synthesis of liveness enforcing supervisors in Petri nets. In Proceedings of the American control conference (pp. 4943-4948), Arlington, VA.
7. Li Y., Wonham W.M. Control of vector discrete-event systems I - the base model. IEEE Transactions on Automatic Control. 38(8):1993;1214-1227.
8. Li Y., Wonham W.M. Control of vector discrete-event systems II - controller synthesis. IEEE Transactions on Automatic Control. 39(3):1994;512-531.
9. Moody J., Antsaklis P. Petri net supervisors for DES with uncontrollable and unobservable transitions. IEEE Transactions on Automatic Control. 45(3):2000;462-476.
10. Murata T. Circuit theoretic analysis and synthesis of marked graphs. IEEE Transactions on Circuits and Systems. 24(7):1977;400-405.
11. Murata T. Petri nets. Properties, analysis and applications Proceedings of the IEEE. 77(4):1989;541-580.
12. Ramadge W., Wonham W.M. On the supremal controllable language of a given language. SIAM Journal of Control and Optimization. 8(3):1987;637-659.
13. Rezg, N., Xie, X., & Ghaffari, A. (2000). Supervisory control in discrete event systems using the theory of regions. In Discrete event systems: Analysis and control (pp. 391-398). Dordrecht, Kluwer Academic Publishers.
14. Schrijver A. Theory of linear and integer programming. 1986;Wiley, New York.
15. Valk R., Jantzen M. The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica. 21:1985;643-674.
16. Yamalidou K., Moody J., Lemmon M., Antsaklis P. Feedback control of Petri nets based on place invariants. Automatica. 32(1):1996;15-28.