Minimal counterexamples for linear-time probabilistic verification

Abstract Counterexamples for property violations have a number of important applications like supporting the debugging of erroneous systems and verifying large systems via counterexample-guided abstraction refinement. In this paper, we propose the usage of minimal critical subsystems of discrete-time Markov chains and Markov decision processes as counterexamples for violated ω -regular properties. Minimality can thereby be defined in terms of the number of states or transitions. This problem is known to be NP-complete for Markov decision processes. We show how to compute such subsystems using mixed integer linear programming and evaluate the practical applicability in a number of experiments. They show that our method yields substantially smaller counterexample than using existing techniques.

[1]  Jan Kretínský,et al.  Deterministic Automata for the (F,G)-fragment of LTL , 2012, CAV.

[2]  Directed and heuristic counterexample generation for probabilistic model checking: a comparative evaluation , 2010, QUOVADIS '10.

[3]  Henrik Ejersbo Jensen,et al.  Reachability Analysis of Probabilistic Systems by Successive Refinements , 2001, PAPM-PROBMIV.

[4]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[5]  Sasha Rubin,et al.  Verifying ω-regular properties of Markov chains , 2004 .

[6]  Maurice Herlihy,et al.  Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.

[7]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[8]  Alon Itai,et al.  Symmetry breaking in distributed networks , 1990, Inf. Comput..

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

[10]  Moshe Y. Vardi.  Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach , 1999, ARTS.

[11]  Armin Biere,et al.  Shortest Counterexamples for Symbolic Model Checking of LTL with Past , 2005 .

[12]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[13]  Michael Günther,et al.  Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA , 2010 .

[14]  Marta Z. Kwiatkowska,et al.  The PRISM Benchmark Suite , 2012, 2012 Ninth International Conference on Quantitative Evaluation of Systems.

[15]  Lijun Zhang,et al.  Probabilistic CEGAR , 2008, CAV.

[16]  Grégoire Sutre,et al.  An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems , 2003, LPAR.

[17]  Helmut Veith,et al.  Tree-like counterexamples in model checking , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[18]  Edmund M. Clarke,et al.  Efficient generation of counterexamples and witnesses in symbolic model checking , 1995, DAC '95.

[19]  Nils Jansen,et al.  Hierarchical Counterexamples for Discrete-Time Markov Chains , 2011, ATVA.

[20]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[21]  Daniele Varacca,et al.  Counterexamples in Probabilistic LTL Model Checking for Markov Chains , 2009 .

[22]  Michael Huth,et al.  PCTL model checking of Markov chains: Truth and falsity as winning strategies in games , 2010, Perform. Evaluation.

[23]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[24]  Helmut Veith,et al.  Counterexamples Revisited: Principles, Algorithms, Applications , 2003, Verification: Theory and Practice.

[25]  Nils Jansen,et al.  Minimal Critical Subsystems for Discrete-Time Markov Models , 2012, TACAS.

[26]  Edmund M. Clarke,et al.  Assume-Guarantee Abstraction Refinement for Probabilistic Systems , 2012, CAV.

[27]  Edmund M. Clarke,et al.  Learning Probabilistic Systems from Tree Samples , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[28]  Krishnendu Chatterjee,et al.  Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification , 2011, SODA '11.

[29]  Husain Aljazzar,et al.  K⁎: A heuristic search algorithm for finding the k shortest paths , 2011, Artif. Intell..

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

[31]  C. Baier,et al.  Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic , 2005 .

[32]  Joost-Pieter Katoen,et al.  Counterexample Generation in Probabilistic Model Checking , 2009, IEEE Transactions on Software Engineering.

[33]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[34]  Mahesh Viswanathan,et al.  A counterexample-guided abstraction-refinement framework for markov decision processes , 2008, TOCL.

[35]  Sandeep K. Shukla,et al.  Evaluating the reliability of NAND multiplexing with PRISM , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[36]  Christel Baier,et al.  Principles of model checking , 2008 .

[37]  Florian Leitner-Fischer,et al.  DiPro - A Tool for Probabilistic Counterexample Generation , 2011, SPIN.

[38]  Nils Jansen,et al.  The COMICS Tool - Computing Minimal Counterexamples for DTMCs , 2012, ATVA.

[39]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[40]  Bernd Becker,et al.  Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking , 2009, VMCAI.

[41]  Nils Jansen,et al.  Minimal Critical Subsystems as Counterexamples for omega-Regular DTMC Properties , 2012, MBMV.

[42]  Nikolaj Bjørner,et al.  Satisfiability modulo theories , 2011, Commun. ACM.

[43]  Edmund M. Clarke,et al.  The Birth of Model Checking , 2008, 25 Years of Model Checking.

[44]  Charles Pecheur,et al.  Rich Counter-Examples for Temporal-Epistemic Logic Model Checking , 2012, IWIGP.

[45]  Bruno Dutertre,et al.  A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[46]  Theo C. Ruys,et al.  The Bounded Retransmission Protocol Must Be on Time! , 1997, TACAS.

[47]  Alberto Griggio,et al.  A Practical Approach to Satisability Modulo Linear Integer Arithmetic , 2012, J. Satisf. Boolean Model. Comput..

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

[49]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[50]  Helmut Veith,et al.  25 Years of Model Checking - History, Achievements, Perspectives , 2008, 25 Years of Model Checking.

[51]  Pedro R. D'Argenio,et al.  Significant Diagnostic Counterexamples in Probabilistic Model Checking , 2008, Haifa Verification Conference.

[52]  Husain Aljazzar,et al.  Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking , 2010, IEEE Transactions on Software Engineering.

[53]  Bernd Becker,et al.  Minimal Critical Subsystems as Counterexamples for ω-Regular DTMC Properties , 2011 .

[54]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[55]  Michael Huth,et al.  Verification and Refutation of Probabilistic Specifications via Games , 2009, FSTTCS.

[56]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

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

[58]  Paul Gastin,et al.  Minimization of Counterexamples in SPIN , 2004, SPIN.

[59]  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..

[60]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[61]  Christel Baier,et al.  LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[62]  Marta Z. Kwiatkowska,et al.  Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..

[63]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[64]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

[65]  Enrico Tronci,et al.  Finite horizon analysis of Markov Chains with the Murϕ verifier , 2006, International Journal on Software Tools for Technology Transfer.