Abstract
Considers the nonblocking supervisory control problems of nondeterministic discrete event systems (DESs) which are modeled as nondeterministic automata with /spl epsiv/-moves. Based on language models, the paper presents the necessary and sufficient conditions for the existence of a nonblocking supervisor to achieve a given language specification for a nondeterministic DES. The developed nonblocking supervisor always guarantees the absence of blocked states in a controlled nondeterministic system. Moreover, when the language specification does not satisfy the existence conditions, the paper provides the computational algorithm for finding the supremal language of the specification which satisfies the conditions. Furthermore, the results developed are demonstrated through the example of an assembly work station.
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.
