1. Verification of temporal properties on hybrid automata by simulation relations
- Author
-
Alessandro D'Innocenzo, M.D. Di Benedetto, A. Agung Julius, S. Di Gennaro, and George J. Pappas
- Subjects
Model checking ,Theoretical computer science ,Timed automaton ,Quantum finite automata ,Automata theory ,Hybrid automaton ,Abstraction model checking ,ω-automaton ,Algorithm ,Computer Science::Formal Languages and Automata Theory ,Mathematics ,Mobile automaton - 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].
- Published
- 2007
- Full Text
- View/download PDF