Abstract
The aim of this paper is the predictive control of Timed Event Graphs with specifications defined by P-time Event Graphs. We propose a fixed-point approach which leads to a pseudo-polynomial algorithm. As the performance of the algorithm is crucial in on-line control, we highlight an important case where the resolution of this first algorithm is efficient. The second technique is a space controller on a horizon leading to a strongly polynomial algorithm.
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.
