Advertisement

Unification & Sharing in Timed Automata Verification

  • Alexandre David
  • Gerd Behrmann
  • Kim G. Larsen
  • Wang Yi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2648)

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.

Keywords

Hash Table Variable Vector Location Vector Symbolic State Reachability Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Christensen and L. M. Kristensen. State space analysis of hierarchical coloured petri nets. In B. Farwer, D. Moldt, and M-O. Stehr, editors, Proceedings of PNSE’97, number 205, pages 32–43, Hamburg, Germany, 1997.Google Scholar
  2. [2]
    Gianfranco F. Ciardo and David M. Nicol. Automated parallelization of discrete state-space generation. In Journal of Parallel and Distributed Computing, volume 47, pages 153–167. ACM, 1997.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alexandre David
    • 1
  • Gerd Behrmann
    • 2
  • Kim G. Larsen
    • 2
  • Wang Yi
    • 1
  1. 1.Department of Information TechnologyUppsala UniversitySweden
  2. 2.Department of Computer ScienceAalborg UniversityDenmark

Personalised recommendations