A Relaxed Framework for Coordination Control of Discrete-Event Systems
Jan Komenda, Tom\'a\v{s} Masopust, Jan H. van Schuppen

TL;DR
This paper introduces a simplified and relaxed coordination control framework for discrete-event systems, removing the supervisor from the coordinator and easing restrictions, which streamlines synthesis and guarantees controllability.
Contribution
It presents a novel relaxed framework that eliminates the supervisor for the coordinator, simplifying the coordination control process and extending fundamental theorems.
Findings
Simplified coordination control framework without supervisor for coordinator
Able to compute conditionally controllable sublanguages without previous restrictions
Framework maintains validity of fundamental theorems in the relaxed setting
Abstract
In this paper, we simplify the coordination control approach by removing the supervisor for the coordinator from the closed-loop system and relax the restrictions placed on a coordinator. This relaxation results in the simplification of the whole coordination control framework, including the notions of conditional controllability, conditional observability, and conditional normality. Compared to our previous work, the role of the supervisor on a coordinator alphabet is postponed until the final stage of the coordination control synthesis. This completes and clarifies our previous results, while all the fundamental theorems remain valid in the relaxed framework. Unlike previous approaches we can always compute a conditionally controllable sublanguage without any restricting conditions we have used before.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · Formal Methods in Verification · Real-Time Systems Scheduling
