SUPERVISORY CONTROL OF DISCRETE-EVENT SYSTEMS

In its earliest formulation, supervisory control theory for discrete e vent systems addresses formal control synthesis for discrete event sys tems in an abstract framework of formal languages and automata. Key pr operties determining existence of controllers include controllability and (co-)observability of languages. A principal theme is the modular decomposition of control problems as a means of managing their complex ity. Recent work has added such features as real time and infinite eve nt strings to the modelling framework, and contributed to the manageme nt of computational complexity through the introduction of structural assumptions and on-line synthesis procedures.