Abstract
Abstract This paper establishes a connection between supervisory control theory (SCT) and reactive synthesis (RS) in the situation where both the plant and the specification are modeled by *-languages, i.e., formal languages over finite words. In particular, we show that the deterministic finite automaton G typically used in SCT to construct a maximally permissive supervisor f for a plant language L w.r.t. a specification language E, can be interpreted as a two-player game which allows to solve the considered synthesis problem by a two-nested fixed-point algorithm in the µ-calculus over G. The resulting game turns out to be a cooperative Buchi-type game which allows for a maximally permissive solution in the particular context of SCT. This is surprising, as classical Buchi games do not have this property.
Sign-in/Register to access full text options 
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.
