Abstract

The Ramadge-Wonham supervisory control paradigm has been shown effective in dealing with logic control. Nevertheless, time-related performance is always one of the major concerns in industry. Current methods for synthesizing time optimal supervisors are incapable of dealing with large discrete event systems with massive state spaces. This paper proposes a method of finding a time optimal accepting trace for discrete event systems. It also proposes abstraction methods based upon language projection, and pruning capable of finding such traces for large discrete event systems. The algorithms are tested on a large discrete event system model in order to show their effectiveness.

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 call

Disclaimer: 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.