Supremal normal sublanguages of large distributed discrete-event systems

Abstract

Coalgebraic methods provide new results and insights for modular supervisory control of discrete-event systems (DES), where the overall system is composed of subsystems that are themselves partially observed DES. It is well known that the computation of supremal normal sublanguages is computationally very difficult. The attention of this paper is focused on complex distributed systems that are composed of a large number of small subsystems that are combined in a modular fashion. Conditions are derived under which supremal normal sublanguages commute with synchronous product, i.e. the computation of supremal normal sublanguages can be done locally. The coinduction proof principle is used to obtain our main result.