Model Checking by Random Walk
1999 (English)In: Proceedings of the ECSEL Workshop (CCSSE), 1999Conference paper (Other academic)
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.
Place, publisher, year, edition, pages
National CategoryComputer Science
IdentifiersURN: urn:nbn:se:liu:diva-59902OAI: oai:DiVA.org:liu-59902DiVA: diva2:354005