Download:
|
by Gerd Behrmann, Johan Bengtsson, Alexandre David, Kim G. Larsen, Paul Pettersson, Wang Yi
http://www.docs.uu.se/docs/rtmv/papers/bbdlpw-ftrtft02.ps.gz
Add To MetaCart
Abstract:
Abstract In this paper we present the continuous and on-going development of datastructures and algorithms underlying the verication engine of the tool Uppaal. In particular, we review the datastructures of Dierence Bounded Matrices, Minimal Constraint Representation and Clock Dierence Diagrams used in symbolic state-space representation and-analysis for real-time systems. In addition we report on distributed versions of the tool, and outline the design and experimental results for new internal datastructures to be used in the next generation of Uppaal. Finally, we mention work on complementing methods involving acceleration, abstraction and compositionality. 1
Citations
|
2315
|
Graph-based algorithms for boolean function manipulation
– Bryant
- 1986
|
|
1397
|
Dynamic Programming
– Bellman
- 1957
|
|
693
|
Parallel Program Design { A Foundation
– Chandy, Misra
- 1988
|
|
60
|
Model checking of real-time reachability properties using abstractions
– Daws, Tripakis
- 1998
|
|
35
|
Model checking via reachability testing for timed automata
– ACETO, BURGUEO, et al.
- 1998
|
|
28
|
Distributed timed model checking - how the search order matters
– Behrmann, Hune, et al.
|
|
8
|
A performance study of distributed timed automata reachability analysis
– Behrmann
- 2002
|
|
8
|
Two examples of veri of multirate timed automata with Kronos
– Daws, Yovine
- 1995
|
|
7
|
Timing Assumptions and Veri of Finite-State Concurrent Systems
– Dill
- 1989
|
|
7
|
Exact acceleration of real-time model checking
– Hendriks, Larsen
- 2002
|
|
3
|
DBMs and STates in Timed Systems
– Clocks
- 2002
|
|
3
|
Speci and Veri of Polling Real-Time Systems
– Dierks
- 1999
|
|
1
|
The next generation of uppaal. Submitted
– David, Behrmann, et al.
|
|
1
|
Devlopment of reactive programs using uppaal
– Hendriks
- 2002
|