On-the-Fly Confluence Detection for Statistical Model Checking

Statistical model checking is an analysis method that circumvents the state space explosion problem in model-based verification by combining probabilistic simulation with statistical methods that provide clear error bounds. As a simulation-based technique, it can only provide sound results if the underlying model is a stochastic process. In verification, however, models are usually variations of nondeterministic transition systems. The notion of confluence allows the reduction of such transition systems in classical model checking by removing spurious nondeterministic choices. In this paper, we show that confluence can be adapted to detect and discard such choices on-the-fly during simulation, thus extending the applicability of statistical model checking to a subclass of Markov decision processes. In contrast to previous approaches that use partial order reduction, the confluence-based technique can handle additional kinds of nondeterminism. In particular, it is not restricted to interleavings. We evaluate our approach, which is implemented as part of the modes simulator for the Modest modelling language, on a set of examples that highlight its strengths and limitations and show the improvements compared to the partial order-based method.

[1]  Håkan L. S. Younes,et al.  Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling , 2002, CAV.

[2]  Christel Baier,et al.  Partial Order Reduction for Probabilistic Branching Time , 2006, QAPL.

[3]  S. C.C. Blom Partial $\tau$-confluence for efficient state space generation , 2001 .

[4]  Jan Friso Groote,et al.  State Space Reduction Using Partial tau-Confluence , 2000, MFCS.

[5]  Holger Hermanns,et al.  A Modest Approach to Checking Probabilistic Timed Automata , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[6]  Christel Baier,et al.  Partial order reduction for probabilistic systems , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..

[7]  Holger Hermanns,et al.  MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems , 2006, IEEE Transactions on Software Engineering.

[8]  Thomas Hérault,et al.  Approximate Probabilistic Model Checking , 2004, VMCAI.

[9]  J. F. Groote,et al.  State space reduction using partial τ-confluence , 2000 .

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

[11]  Anton Wijs,et al.  Sequential and distributed on-the-fly computation of weak tau-confluence , 2012, Sci. Comput. Program..

[12]  Edmund M. Clarke,et al.  Bayesian statistical model checking with application to Stateflow/Simulink verification , 2010, Formal Methods in System Design.

[13]  Holger Hermanns,et al.  Partial Order Methods for Statistical Model Checking and Simulation , 2011, FMOODS/FORTE.

[14]  Pedro R. D'Argenio,et al.  Partial order reduction on concurrent probabilistic programs , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..

[15]  Edmund M. Clarke,et al.  Statistical Model Checking for Markov Decision Processes , 2012, 2012 Ninth International Conference on Quantitative Evaluation of Systems.

[16]  Richard Lassaigne,et al.  Approximate planning and verification for large Markov decision processes , 2012, SAC '12.

[17]  Axel Legay,et al.  Statistical Model Checking: An Overview , 2010, RV.

[18]  Arnd Hartmanns,et al.  Model-Checking and Simulation for Stochastic Timed Systems , 2010, FMCO.

[19]  Sami Evangelista,et al.  Solving the ignoring problem for partial order reduction , 2010, International Journal on Software Tools for Technology Transfer.

[20]  Jaco van de Pol,et al.  State Space Reduction by Proving Confluence , 2002, CAV.

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

[22]  Jaco van de Pol,et al.  Confluence Reduction for Probabilistic Systems (extended version) , 2010, ArXiv.

[23]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[24]  Mahesh Viswanathan,et al.  On Statistical Model Checking of Stochastic Systems , 2005, CAV.

[25]  Håkan L. S. Younes,et al.  Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study , 2004, TACAS.

[26]  Holger Hermanns,et al.  Simulation and Statistical Model Checking for Modestly Nondeterministic Models , 2012, MMB/DFT.

[27]  Mariëlle Stoelinga,et al.  Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .

[28]  Henri Hansen,et al.  A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time , 2014, Theor. Comput. Sci..

[29]  Gordon J. Pace,et al.  Calculating-Confluence Compositionally , 2003, CAV.