Abstract
Abstract: This paper is about deadlock-free scheduling problems for discrete event systems. The main contribution is to propose algorithms that incrementally compute control sequences with minimal or nearminimal duration to drive the marking of timed Petri nets (TPNs) from an initial value to a reference one. These algorithms are based on a partial exploration of the TPN reachability graph with an approach inspired from model predictive control. They include perturbation rejection and forbidden marking avoidance and are suitable to track trajectories in real time context when the initial and reference markings are far from each other.
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.
