Decentralized supervisory control with coalgebra

In this paper a coalgebraic framework for the decentralized control of DES is proposed. The paper is based on the formalism developed for the supervisory control of DES in the partial observation case, the notion of bisimulation, and its generalizations (partial bisimulation, coobservability and control relation). Local indistinguishability relations are used in the relational characterizations of coobservability. Conjunctive and permissive (C&P) as well as disjunctive and antipermissive (D&A) versions of coobservability are captured by their corresponding relations. Coinduction is used to define a new operation on languages called C&P supervised product. Existence of a supervisor that achieves a given specifican this paper a coalgebraic framework for the decentralized control of DES is proposed. The paper is based on the formalism developed for the supervisory control of DES in the partial observation case, the notion of bisimulation, and its generalizations (partial bisimulation, coobservability and control relation). Local indistinguishability relations are used in the relational characterizations of coobservability. Conjunctive and permissive (C&P) as well as disjunctive and antipermissive (D&A) versions of coobservability are captured by their corresponding relations. Coinduction is used to define a new operation on languages called C&P supervised product. Existence of a supervisor that achieves a given specification in the closed-loop system is equivalent to the existence of a partial bisimulation relation, which is at the same time a coobservability and control relation.