Abstract
This note presents a control synthesis approach for discrete event systems modeled by marked graphs with uncontrollable transitions. It solves forbidden state problems characterized by a set of general mutual exclusion constraints. We prove that the closed loop control can reach a deadlock situation. Using the structural proprieties of marked graph we defined causes of the deadlock situation, and we defined a formal method to avoid it.
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.
