On a Distributed Computation of Supervisors in Modular Supervisory Control
Jan Komenda, Tom\'a\v{s} Masopust, J. H. van Schuppen

TL;DR
This paper presents a method for distributed computation of supervisors in modular discrete-event systems, including algorithms and relaxations for specifications that do not initially satisfy necessary properties.
Contribution
It introduces a novel characterization and algorithm for distributed supervisor computation, along with a relaxation approach for non-compliant specifications.
Findings
Distributed supervisor computation is feasible with the proposed algorithm.
Relaxation of coordination control enables handling of non-satisfying specifications.
The approach improves scalability and modularity in supervisory control systems.
Abstract
In this paper, we discuss a supervisory control problem of modular discrete-event systems that allows for a distributed computation of supervisors. We provide a characterization and an algorithm to compute the supervisors. If the specification does not satisfy the properties, we make use of a relaxation of coordination control to compute a sublanguage of the specification for which the supervisors can be computed in a distributed way.
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.
