Supervisory Control of Extended Finite Automata Using Transition Projection
Paper i proceeding, 2012

A limitation of the Ramadge and Wonham (RW) framework for the supervisory control theory is the explicit state representation using finite automata, often resulting in complex and unintelligible models. Extended finite automata (EFAs), i.e., deterministic finite automata extended with variables, provide compact state representation and then make the control logic transparent through logic expressions of the variables. A challenge with this new control framework is to exploit the rich control structure established in RW's framework. This paper studies the decentralized control structure with EFAs. To reduce the computational complexity, the controller is synthesized based on model abstraction of subsystems, which means that the global model of the entire system is unnecessary. Sufficient conditions are presented to guarantee that the decentralized supervisors result in maximally permissive and nonblocking control to the entire system.


Computational complexity

Computational modeling


Supervisory control


Mohammad Reza Shoaei

Chalmers, Signaler och system, System- och reglerteknik

Lei Feng

Kungliga Tekniska Högskolan (KTH)

Bengt Lennartson

Chalmers, Signaler och system, System- och reglerteknik

Proceedings of the IEEE Conference on Decision and Control

07431546 (ISSN) 25762370 (eISSN)

Article number 6427390 7259-7266 6427390





Datavetenskap (datalogi)



Mer information

Senast uppdaterat