Statistical Model Checking Using Perfect Simulation

We propose to perform statistical probabilistic model checking by using perfect simulation in order to verify steady-state and time unbounded until formulas over Markov chains. The model checking of probabilistic models by statistical methods has received increased attention in the last years since it provides an interesting alternative to numerical model checking which is poorly scalable with the increasing model size. In previous statistical model checking works, unbounded until formulas could not be efficiently verified, and steady-state formulas had not been considered due to the burn-in time problem to detect the steady-state. Perfect simulation is an extension of Markov Chain Monte Carlo (MCMC) methods that allows us to obtain exact steady-state samples of the underlying Markov chain, and thus it avoids the burn-in time problem to detect the steady-state. Therefore we suggest to verify time unbounded until and steady-state dependability properties for large Markov chains through statistical model checking by combining perfect simulation and statistical hypothesis testing.

[1]  Robert K. Brayton,et al.  Model-checking continuous-time Markov chains , 2000, TOCL.

[2]  Ana Busic,et al.  Perfect simulation and non-monotone Markovian systems , 2008, VALUETOOLS.

[3]  P. Glasserman,et al.  Monotone Structure in Discrete-Event Systems , 1994 .

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

[5]  Nihal Pekergin,et al.  Statistical Model Checking for Steady State Dependability Verification , 2009, 2009 Second International Conference on Dependability.

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

[7]  Håkan L. S. Younes,et al.  Numerical vs. statistical probabilistic model checking , 2006, International Journal on Software Tools for Technology Transfer.

[8]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[9]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[10]  Håkan L. S. Younes Error Control for Probabilistic Model Checking , 2006, VMCAI.

[11]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[12]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[13]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[14]  Håkan L. S. Younes,et al.  Statistical probabilistic model checking with a focus on time-bounded properties , 2006, Inf. Comput..

[15]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[16]  Jean-Marc Vincent,et al.  On the exact simulation of functionals of stationary Markov chains , 2004 .

[17]  Jean-Marc Vincent,et al.  Perfect simulation of index based routing queueing networks , 2006, PERV.

[18]  Jean-Marc Vincent,et al.  Psi^2 a Software Tool for the Perfect Simulation of Finite Queueing Networks , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

[19]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[20]  Jean-Marc Vincent,et al.  Perfect Simulation of Stochastic Automata Networks , 2008, ASMTA.