Directed and heuristic counterexample generation for probabilistic model checking: a comparative evaluation

Authors:
Husain Aljazzar;Matthias Kuntz;Florian Leitner-Fischer;Stefan Leue
Affiliations:
University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany
Venue:
Proceedings of the 2010 ICSE Workshop on Quantitative Stochastic Models in the Verification and Design of Software Systems
Year:
2010

Citing 16
Cited 1

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Finding the k Shortest Paths

SIAM Journal on Computing
Verifying Continuous Time Markov Chains

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Model-Checking Algorithms for Continuous-Time Markov Chains

IEEE Transactions on Software Engineering
A Markov Reward Model Checker

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Probabilistic Model-Checking Support for FMEA

QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Hintikka Games for PCTL on Labeled Markov Chains

QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Regular Expressions for PCTL Counterexamples

QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Debugging of Dependability Models Using Interactive Visualization of Counterexamples

QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Counterexample Generation in Probabilistic Model Checking

IEEE Transactions on Software Engineering
Generation of Counterexamples for Model Checking of Markov Decision Processes

QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Safety Analysis of an Airbag System Using Probabilistic FMEA and Probabilistic Counterexamples

QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking

IEEE Transactions on Software Engineering
A lazy version of Eppstein's K shortest paths algorithm

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Extended directed search for probabilistic timed reachability

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
PRISM: a tool for automatic verification of probabilistic systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

DiPro: a tool for probabilistic counterexample generation

Proceedings of the 18th international SPIN conference on Model checking software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generation of counterexamples for probabilistic model checking has been an area of active research over the past five years. Tangible outcome of this research are novel directed and heuristic algorithms for efficient generation of probabilistic counterexamples, such as K* and XBF. In this paper we present an empirical evaluation of the efficiency of these algorithms and the well-known Eppstein's algorithm. We will also evaluate the effect of optimisations applied to Eppstein, K* and XBF. Additionally, we will show, how information produced during model checking can be used to guide the search for counterexamples. This is a first step towards automatically generating heuristic functions. The experimental evaluation of the various algorithms is done by applying them to one case study, knwon from the literature on probabilistic model checking and one case study taken from the automotive industry.