Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication
Jan Komenda, Tom\'a\v{s} Masopust
TL;DR
This paper presents a method to compute controllable and coobservable sublanguages in decentralized supervisory control by extending observable events through communication, ensuring coobservability and enabling decentralized control.
Contribution
It introduces a communication-based approach to achieve controllability and coobservability in decentralized supervisory control, applicable to both prefix-closed and non-prefix-closed specifications.
Findings
Guarantees coobservability by construction
Enables decentralized computation of supervisors
Applicable to various specification types
Abstract
In decentralized supervisory control, several local supervisors cooperate to accomplish a common goal (specification). Controllability and coobservability are the key conditions to achieve a specification in the controlled system. We construct a controllable and coobservable sublanguage of the specification by using additional communications between supervisors. Namely, we extend observable events of local supervisors via communication and apply a fully decentralized computation of local supervisors. Coobservability is then guaranteed by construction. Sufficient conditions to achieve the centralized optimal solution are discussed. Our approach can be used for both prefix-closed and non-prefix-closed specifications.
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.