Download:
|
by Gerd Behrmann, Patricia Bouyer, Kim G. Larsen, Radek Pelnek
http://www.lsv.ens-cachan.fr/Publis/PAPERS/BBLP-tacas04.ps
Add To MetaCart
Abstract:
Abstract. Timed automata have an infinite semantics. For verification purposes, one usually uses zone based abstractions w.r.t. the maximal constants to which clocks of the timed automaton are compared. We show that by distinguishing maximal lower and upper bounds, significantly coarser abstractions can be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability. We demonstrate how information about lower and upper bounds can be used to optimise the algorithm for bringing a di#erence bound matrix into normal form. Finally, we experimentally demonstrate that the new techniques dramatically increases the scalability of the real-time model checker Uppaal. 1
Citations
|
1393
|
A theory of timed automata
– Alur, Dill
- 1994
|
|
351
|
Automata for modeling real-time systems
– Alur, Dill
- 1990
|
|
332
|
Uppaal in a Nutshell
– Larsen, Pettersson, et al.
- 1997
|
|
165
|
Timing Assumptions and Verification of Finite-State Concurrent Systems
– Dill
- 1989
|
|
98
|
Orna Grumberg and Doron A. Peled: Model Checking. Cambridge
– Clarke
- 1999
|
|
60
|
Model checking of real-time reachability properties using abstractions
– Daws, Tripakis
- 1998
|
|
40
|
Efficient verification of real-time systems: Compact data structure and state space reduction
– Larsen, Larsson, et al.
- 1997
|
|
34
|
Representing and Modeling Digital Circuits
– Rokicki
- 1993
|
|
27
|
Job-shop scheduling using timed automata
– Abdeddaïm, Maler
- 2001
|
|
15
|
Untameable timed automata
– Bouyer
- 2003
|
|
8
|
Static guard analysis in timed automata verification
– Behrmann, Bouyer, et al.
- 2003
|
|
3
|
DBMs ans States in Timed Systems
– Clocks
- 2002
|
|
3
|
Timed automata may cause some troubles. Research Report LSV--02--9, Laboratoire Spcification et Vrification, ENS de
– Bouyer
- 2002
|