On the Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control.
Jan Komenda, Tomáš Masopust · arXiv (Cornell University) · 2015
In decentralized supervisory control, several local control agents (supervisors) cooperate to achieve a common goal expressed by a safety specification and/or nonblockingness. Coobservability is the key condition to achieve the specification as the resulting language of the controlled system. One of the most important problems is thus to compute a coobservable sublanguage of the specification. In this paper, we show how to compute a controllable and coobservable sublanguage of the specification in a computationally efficient way. The method is motivated by recent results in coordination control of modular discrete-event systems, namely by the notion of conditional decomposability.