The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Information and Computation
Competitive Markov decision processes
Competitive Markov decision processes
SIAM Journal on Computing
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Temporal Logics for the Specification of Performance and Reliability
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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
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
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
DiPro: a tool for probabilistic counterexample generation
Proceedings of the 18th international SPIN conference on Model checking software
Hierarchical counterexamples for discrete-time Markov chains
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Computing the leakage of information-hiding systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Minimal critical subsystems for discrete-time markov models
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Refinement and difference for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
High-Level counterexamples for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Effective verification of confidentiality for multi-threaded programs
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.00 |
This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in counterexamples are grouped together in witnesses that are likely to provide similar debugging information to the user. We list five properties that witnesses should satisfy in order to be useful as debugging aid: similarity, accuracy, originality, significance, and finiteness. Our witnesses contain paths that behave similarly outside strongly connected components. Then, we show how to compute these witnesses by reducing the problem of generating counterexamples for general properties over Markov Decision Processes, in several steps, to the easy problem of generating counterexamples for reachability properties over acyclic Markov chains.