Abstract
This paper studies the supervisory control problem in Petri nets with unobservable transitions and uncontrollable transitions. Given a Petri net of such a type, a supervisor is designed based on the basis reachability graph in which the set of explicit transitions is a superset of the set of observable transitions. A sensor reduction method is proposed to find a minimal set of observable transitions without compromising the permissiveness. Removal of redundant observable transitions leads to a more compact control structure and a lower cost related to sensor deployment.
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.
