In supervisor synthesis achieving nonblockingness is a major computational challenge when a target system consists of a large number of local components. To overcome this difficulty we propose a coordinated distributed supervisor synthesis approach, where specifications are enforced by local supervisors. To avoid conflicting among local supervisors, coordinators are created based on automaton a...

We present a hierarchical control theory for supervisory automata based on state aggregation. Conditions are determined on state partitions which ensure that the control of transitions between blocks in a high-level (i.e. aggregated) model, combined with local state-dependent controls, is eeective in the sense of achieving speciications given either for the high-level model or for the low-level...

For discrete event systems, modular supervisory control refers to modular design of a supervisor when multiple control specifications are given. This problem has been studied for the case when the desired specifications must all simultaneously be met. In this paper, we study the case when at least one of the desired specifications must always be met while never blocking any of the remaining spe...

Situation awareness (SA) is a critical factor for human decision making and performance in dynamic environments. Actually SA is a mental model of the current state of the environment and includes many types of complex systems such as safety supervisory systems. The current paper employs two focus areas including neural network and expert system for maintaining SA in a safety supervisory system....

The paper deals with the supervisory control of a nonlinear uncertain system in which the switching is directed by the recently introduced state-dependent dwell-time switching logic. The proposed supervisory control architecture is shown to regulate to zero the state of the system without requiring the switching to stop in 4nite time. A signi4cant class of systems to which the control architect...

We study the supervisory control problem for closed languages when the specifications are given in terms of control objectives i.e. a pairing of predicates associated with blocking events. We show that under some conditions the supervisory control problem is decidable for non-regular languages and results in obtaining the least restrictive behavior. The result appears to give an extension of th...