Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control

In this paper we present a new approach to decentralized supervisory control of large automata with communicating supervisors. We first generalize the recently developed top-down architecture of multilevel coordination control with a hierarchical structure of groups of subsystems, their respective coordinators and supervisors. Namely, in the case where the equivalent conditions for achieving a specification language fail to be satisfied, we propose sufficient conditions for a distributed computation of the supremal achievable sublanguage. We then apply the obtained constructive results of multilevel coordination control to decentralized supervisory control with communication, where local supervisors of subsystems within a group communicate with each other via the coordinator of the group. Our approach is illustrated by an example

Combined Top-down and Bottom-up Approach to Multilevel Supervisory Control

Recently, we have proposed two complementary approaches, top-down and bottom-up, to multilevel supervisory control of discrete-event systems. In this paper, we compare and combine these approaches. The combined approach has strong features of both approaches, namely, a lower complexity of the top-down approach with the generality of the bottom-up approach. We show that, for prefix-closed languages, a posteriori supervisors computed in the bottom-up manner do not alter maximal permissiveness within the three-level coordination control architecture, that is, the supremal three-level conditionally-controllable and conditionally-normal language can always be computed in a distributed way using multilevel coordination. Moreover, a general polynomial-time procedure for non-prefix closed case is proposed based on coordinators for nonblockingness and a posteriori supervisors