The formal verification process of a design with respect to temporal specifications is essential while designing (reactive) systems. The process we present here relies on timed Live Sequence Charts (LSCs) to describe properties of the system under development. The LSCs are unwound into timed automata and automatically verified with a fair CTL model checker. We describe all the transitions that take part in this completely automatic process. To obtain a more efficient verification we introduce a new class of automata, which is proven to be an interesting subset of the timed Buchi automata, and show, theoretically and algorithmically, how the efficient verification of these properties can be conducted using the VIS model checker.
CITATION STYLE
Grégoire, B. (2002). Automata Oriented Program Verification ´. Retrieved from formal verification, model checking, reactive system, temporal re-quirement, VIS, invariant check, timed automaton, non-failure acceptance.
Mendeley helps you to discover research relevant for your work.