Abstract
Supervisory control in the context of /spl omega/-languages is considered. The nominal supervisor design problem is to find a non-blocking supervisor for a nominal plant such that the closed-loop infinite behavior equals a specified closed-loop behavior. The robustness of solutions to the nominal problem is defined with respect to variations in the plant. It is shown there exists a supervisor solving the nominal problem which maximizes the set of plants for which the closed-loop languages for all other plants in the set satisfy lower and upper bounds in the sense of language containment. Computational issues are discussed and the theoretical results are illustrated with an example.
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.
