Abstract
The problem of supervisory control, in its most basic form, is well understood for regular parameters, i.e., with regular languages for plant and upper-bound language-inclusion specification. However, when dropping the requirement of regularity, the situation becomes much more involved: even decidability becomes an issue. In this paper, we propose a simplistic but yet fairly general approach in that non-regular parameters are replaced by regular substitutes. In a language based setting we provide (a) conditions such that any solution found for the substitute parameters carries over to the original problem and (b) a refinement scheme which can be applied when the substitute parameters render the control problem at hand unsolvable. For practical purposes, we further elaborate our approach for plants represented as unbounded Petri nets and (c) identify a condition under which the alternation of trial synthesis and refinement is guaranteed to terminate with success.
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.
