Abstract
In many practical applications, we need to compute a nonblocking supervisor that not only complies with pre-specified safety requirements but also achieves a certain time optimal performance such as maximum throughput. Previous time optimal synthesis methods have had the significant drawback of only being able to deal with acyclic behavior. In this paper we propose a time optimal synthesis method which can deal with potentially infinite behavior. This is accomplished by dividing a system into progressive behaviors with which the system must be capable of finishing it task within a finite amount of time, and nonprogressive behaviors which can lead to the system having more tasks to complete, and potentially infinite behavior. We also proposed an algorithm with pseudo polynomial time complexity for computing such a supervisor.
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.
