Computation of supremal sublanguages of supervisory control using coalgebra

Coalgebraic techniques are applied for the supervisory control of discrete-event systems (DES) with partial observations. The paper is based on the formalism developed for supervisory control of DES in the full observation case, i.e., the notion of bisimulation, its generalizations (partial bisimulation and control relation), and the finality of the automaton of partial languages. The introduced concept of nondeterministic weak transitions yields a new concept of deterministic weak transitions. These are shown to be useful in the study of partially observed DES. They give rise to the relational characterizations of normality and observability. These characterizations lead to new algorithms for supremal sublanguages that are compared to the known ones in the literature.