Providing evidence of likely being on time: counterexample generation for CTMC model checking

Authors:
Tingting Han;Joost-Pieter Katoen
Affiliations:
Software Modelling and Verification, RWTH Aachen University, Germany and Formal Methods and Tools, University of Twente, The Netherlands;Software Modelling and Verification, RWTH Aachen University, Germany and Formal Methods and Tools, University of Twente, The Netherlands
Venue:
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Year:
2007

Citing 13
Cited 4

Transient analysis of acyclic markov chains

Performance Evaluation
Computing Poisson probabilities

Communications of the ACM
Finding the k Shortest Paths

SIAM Journal on Computing
Model-checking continuous-time Markov chains

ACM Transactions on Computational Logic (TOCL)
Tree-Like Counterexamples in Model Checking

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A new methodology for calculating distributions of reward accumulated during a finite interval

FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Model-Checking Algorithms for Continuous-Time Markov Chains

IEEE Transactions on Software Engineering
PRISM 2.0: A Tool for Probabilistic Model Checking

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
A Markov Reward Model Checker

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Counterexamples in probabilistic model checking

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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

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
A counterexample-guided abstraction-refinement framework for markov decision processes

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic model checkers typically provide a list of individual state probabilities on the refutation of a temporal logic formula. For large state spaces, this information is far too detailed to act as useful diagnostic feedback. For quantitative (constrained) reachability problems, sets of paths that carry enough probability mass are more adequate. We recently have shown that in the context of discrete-time probabilistic processes, such sets of smallest size can be efficiently computed by (hop-constrained) k-shortest path algorithms. This paper considers the problem of generating counterexamples for continuous-time Markov chains. The key contribution is a set of approximate algorithms for computing small sets of paths that indicate the violation of time-bounded (constrained) reachability probabilities.