Abstract
The authors discuss supervisory control of probabilistic discrete event systems. Supervisors for such systems will take probabilities of event occurrences into consideration in making control decisions. The authors introduce a concept called /spl epsiv/-containment of a given language and subsequently study its algebraic properties. They discuss standard supervisor (with only enablement/disablement) synthesis problems and reset supervisor (with recovery mechanism) synthesis problems for both fully observed and partially observed systems.
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.
