On Algorithms and Extensions of Coordination Control of Discrete-Event Systems
Jan Komenda, Tom\'a\v{s} Masopust, Jan H. van Schuppen
TL;DR
This paper advances the coordination control framework for discrete-event systems by refining key concepts, analyzing supremal sublanguages, and proposing a method for computing coordinators to ensure nonblockingness.
Contribution
It introduces simplified notions of conditional decomposability, controllability, and closedness, and provides a procedure for computing coordinators in non-prefix-closed languages.
Findings
Revised and simplified core concepts of coordination control
Discussed supremal conditionally controllable sublanguages
Presented a procedure for coordinator computation for nonblockingness
Abstract
In this paper, we further develop the coordination control scheme for discrete-event systems based on the Ramadge-Wonham framework. The notions of conditional decomposability, conditional controllability, and conditional closedness are revised and simplified, supremal conditionally controllable sublanguages of general non-prefix-closed languages are discussed, and a procedure for the computation of a coordinator for nonblockingness is presented.
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.