Unification & sharing in timed automata verification

Authors:
Alexandre David;Gerd Behrmann;Kim G. Larsen;Wang Yi
Affiliations:
Department of Information Technology, Uppsala University, Sweden;Department of Computer Science, Aalborg University, Denmark;Department of Computer Science, Aalborg University, Denmark;Department of Information Technology, Uppsala University, Sweden
Venue:
SPIN'03 Proceedings of the 10th international conference on Model checking software
Year:
2003

Citing 1
Cited 2

Automated parallelization of discrete state-space generation

Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing

Hypervolume approximation in timed automata model checking

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Developing UPPAAL over 15 years

Software—Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present work on unifying the two main data structures involved during reachability analysis of timed automata. We also present result on sharing common elements between states. The experimental evaluations show speedups of up to 60% and memory savings of up to 80% compared to previous implementations.