Counterexamples in probabilistic model checking

Authors:
Tingting Han;Joost-Pieter Katoen
Affiliations:
Software Modelling and Verification, RWTH Aachen, Germany and Formal Methods and Tools, University of Twente, The Netherlands;Software Modelling and Verification, RWTH Aachen, Germany and Formal Methods and Tools, University of Twente, The Netherlands
Venue:
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2007

Citing 14
Cited 16

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Finding the k Shortest Paths

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
From symptom to cause: localizing errors in counterexample traces

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree-Like Counterexamples in Model Checking

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Detecting Errors Before Reaching Them

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fate and free will in error traces

International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Optimal scheduling using priced timed automata

ACM SIGMETRICS Performance Evaluation Review
Comparative branching-time semantics for Markov chains

Information and Computation
Proof-like counter-examples

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Counterexamples for timed probabilistic reachability

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Extended directed search for probabilistic timed reachability

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems

Proofs and Refutations for Probabilistic Refinement

FM '08 Proceedings of the 15th international symposium on Formal Methods
Probabilistic CEGAR

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Abstraction Refinement for Probabilistic Software

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Survey on Directed Model Checking

Model Checking and Artificial Intelligence
Significant Diagnostic Counterexamples in Probabilistic Model Checking

HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Counterexamples in Probabilistic LTL Model Checking for Markov Chains

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Providing evidence of likely being on time: counterexample generation for CTMC model checking

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Conditional probabilities over probabilistic and nondeterministic systems

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games

Performance Evaluation
A counterexample-guided abstraction-refinement framework for markov decision processes

ACM Transactions on Computational Logic (TOCL)
Counterexample generation for Markov chains using SMT-based bounded model checking

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
K*: A heuristic search algorithm for finding the k shortest paths

Artificial Intelligence
ProbPoly: a probabilistic inductive logic programming framework with application in model checking

Proceedings of the International Workshop on Machine Learning Technologies in Software Engineering
PASS: abstraction refinement for infinite probabilistic models

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automated rare event simulation for stochastic petri nets

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers algorithms for counterexample generation for (bounded) probabilistic reachability properties in fully probabilistic systems. Finding the strongest evidence (i.e, the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that aremostly deviating from the required probability bound can be computed by adopting (partially new hopconstrained) k shortest paths algorithms that dynamically determine k.