Model Checking by Random Walk
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Conference paper (Other academic)
Proceedings of the ECSEL Workshop (CCSSE)
While model checking algorithms are in theory efficient, they are in practice hampered by the explosive growth of system models. We show that for certain specifications the model cheking problem reduces to a question of reachability in the system state transition graph, and apply a simple, randomized algorithm to this problem.