Abstract
The supervisory control framework formulated by Ramadge and Wonham is extended to allow the synthesis of supervisors which control a given system to perform an arbitrary ω-regular task specified by a nondeterministic Büchi automaton. To this end, the supervisory control paradigm is applied to R.P. Kurshan's L-processes which provide a convenient model for nonterminating discrete event system behaviors. Necessary and sufficient conditions for the existence of supervisors are derived and the synthesis of supervisors is discussed.KeywordsBoolean AlgebraCommunication ProtocolState TrajectorySupervisory ControlAcceptance ConditionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
