Theoretical Computer Science
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Model Checking of Safety Properties
Formal Methods in System Design
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Minimum and Maximum Delay Problems in Real-Time Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
On the Random Walk Method for Protocol Testing
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Automated Analysis of an Audio Control Protocol
Proceedings of the 7th International Conference on Computer Aided Verification
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
On-the-fly symbolic model checking for real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
A Probabilistic Approach to Automatic Verification of Concurrent Systems
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Enhancing random walk state space exploration
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Resource-Aware Verification Using Randomized Exploration of Large State Spaces
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
| Hi-index | 0.00 |
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.