Abstract
Model checking can be used to verify temporal properties of hybrid automata. However, model checking is not decidable in general. We overcome this difficulty by considering a durational graph abstraction, for which model checking is decidable. The contribution of this paper is to show that, given a hybrid automaton and the durational graph abstraction, there exists a simulation relation between the two systems. This approach allows checking properties such as safety, but also timing properties of hybrid automata. We apply our framework to a relevant case study in the context of air traffic management (ATM). For an extended version of this paper refer to [A. D'Innocenzo et al., 2007].
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.
