Abstract
This work discusses the backward reachability of autonomous Max-Plus-Linear (MPL) systems, a class of continuous-space discrete-event models that are relevant for applications dealing with synchronization and scheduling. Given an MPL system and a continuous set of final states, we characterize and compute its “backward reach tube” and “backward reach sets, ” namely the set of states that can reach the final set within a given event interval or at a fixed event step, respectively. We show that, in both cases, the computation can be done exactly via manipulations of difference-bound matrices. Furthermore, we illustrate the application of the backward reachability computations over safety and transient analysis of MPL systems.
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.
