Significant Diagnostic Counterexamples in Probabilistic Model Checking

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.

[1]  Husain Aljazzar,et al.  Counterexamples for Model Checking of Markov Decision Processes , 2007 .

[2]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[3]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[4]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  Erik P. de Vink,et al.  Probabilistic Automata: System Types, Parallel Composition and Comparison , 2004, Validation of Stochastic Systems.

[6]  Luca de Alfaro,et al.  Temporal Logics for the Specification of Performance and Reliability , 1997, STACS.

[7]  Husain Aljazzar,et al.  Extended Directed Search for Probabilistic Timed Reachability , 2006, FORMATS.

[8]  Amir Pnueli,et al.  Probabilistic Verification , 1993, Information and Computation.

[9]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[10]  Joost-Pieter Katoen,et al.  Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking , 2007, ATVA.

[11]  Joost-Pieter Katoen,et al.  Counterexamples in Probabilistic Model Checking , 2007, TACAS.

[12]  Moshe Y. Vardi Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[14]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[15]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[16]  Kim G. Larsen,et al.  Optimal scheduling using priced timed automata , 2005, PERV.

[17]  R. Bellman A Markovian Decision Process , 1957 .

[18]  Zohar Manna,et al.  Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System Verification , 1997, STACS.

[19]  Edwin K. P. Chong,et al.  Discrete event systems: Modeling and performance analysis , 1994, Discret. Event Dyn. Syst..

[20]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[21]  Holger Hermanns,et al.  Counterexamples for Timed Probabilistic Reachability , 2005, FORMATS.