Deep random search for efficient model checking of timed automata (2006)
| Venue: | In Proc. of MW’06, the 7th Monterey Workshop on Composition of Embedded Systems |
| Citations: | 5 - 1 self |
BibTeX
@INPROCEEDINGS{Grosu06deeprandom,
author = {R. Grosu and X. Huang and S. A. Smolka and W. Tan and S. Tripakis},
title = {Deep random search for efficient model checking of timed automata},
booktitle = {In Proc. of MW’06, the 7th Monterey Workshop on Composition of Embedded Systems},
year = {2006},
pages = {37--48}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present DRS (Deep Random Search), a new Las Vegas algorithm for model checking safety properties of timed automata. DRS explores the state space of the simulation graph of a timed automaton by performing random walks up to a prescribed depth. Nodes along these walks are then used to construct a random fringe, which is the starting point of additional deep random walks. The DRS algorithm is complete, and optimal to within a specified depth increment. Experimental results show that it is able to find extremely deep counter-examples for a number of benchmarks, outperforming Open-Kronos and Uppaal in the process. 1
