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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
