Time-Darts: A Data Structure for Verification of Closed Timed Automata

Kenneth Yrke Jørgensen, Kim Guldstrand Larsen, Jiri Srba

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review


Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structure in several mature verification tools. In comparison, discretization offers an easy alternative, with all operations having linear-time complexity in the number of clocks, and yet valid for a large class of closed systems. Unfortunately, fine-grained discretization causes itself a state-space explosion. We introduce a new data structure called time-darts for the symbolic representation of state-spaces of timed automata. Compared with the complete discretization, a single time-dart allows to represent an arbitrary large set of states, yet the time complexity of operations on time-darts remain linear in the number of clocks. We prove the correctness of the suggested reachability algorithm and perform several experiments in order to compare the performance of time-darts and the complete discretization. The main conclusion is that in all our experiments the time-dart method outperforms the complete discretization and it scales significantly better for models with larger constants.
[45] Verification of Liveness Properties on Closed Timed-Arc Petri Nets
TidsskriftElectronic Proceedings in Theoretical Computer Science
Sider (fra-til)141-155
Antal sider15
StatusUdgivet - 2012
Begivenhed7th International Conference on Systems Software Verification - NICTA, Sydney, Australien
Varighed: 28 nov. 201230 nov. 2012
Konferencens nummer: 7


Konference7th International Conference on Systems Software Verification

Fingeraftryk Dyk ned i forskningsemnerne om 'Time-Darts: A Data Structure for Verification of Closed Timed Automata'. Sammen danner de et unikt fingeraftryk.