Unification & Sharing in Timed Automata Verification
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.
KeywordsHash Table Variable Vector Location Vector Symbolic State Reachability Analysis
Unable to display preview. Download preview PDF.
- 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