Dalsgaard, A.E. and Laarman, A.W. and Larsen, K.G. and Olesen, M.Chr. and van de Pol, J.C.
Multi-Core Reachability for Timed Automata.
In: 10th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2012, 18-20 Sep 2012, London, UK.
Lecture Notes in Computer Science 7595.
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-642-33365-1_8
Model checking of timed automata is a widely used technique. But in order to take advantage of modern hardware, the algorithms need to be parallelized. We present a multi-core reachability algorithm for the more general class of well-structured transition systems, and an implementation for timed automata.
Our implementation extends the opaal tool to generate a timed automaton successor generator in c++, that is efficient enough to compete with the UPPAAL model checker, and can be used by the discrete model checker LTSmin, whose parallel reachability algorithms are now extended to handle subsumption of semi-symbolic states. The reuse of efficient lockless data structures guarantees high scalability and efficient memory use.
With experiments we show that opaal+LTSmin can outperform the current state-of-the-art, UPPAAL. The added parallelism is shown to reduce verification times from minutes to mere seconds with speedups of up to 40 on a 48-core machine. Finally, strict BFS and (surprisingly) parallel DFS search order are shown to reduce the state count, and improve speedups.
|Item Type:||Conference or Workshop Paper (Full Paper, Talk)|
|Research Group:||EWI-FMT: Formal Methods and Tools|
|Research Program:||CTIT-DSN: Dependable Systems and Networks|
|Research Project:||CEDICT: 3TU Center of Excellence for ICT|
|Uncontrolled Keywords:||parallel, multi-core, timed automata, well-quasi-ordering, lattice-based model checking, abstraction, symbolic reachability, model checking, lockless, hash table|
|Deposited On:||17 July 2012|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item