Stochastic Model Checking

This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs). Model checking algorithms are given for verifying DTMCs and CTMCs against specifications written in probabilistic extensions of temporal logic, including quantitative properties with rewards. Example properties include the probability that a fault occurs and the expected number of faults in a given time period. We also describe the practical application of stochastic model checking with the probabilistic model checker PRISM by outlining the main features supported by PRISM and three real-world case studies: a probabilistic security protocol, dynamic power management and a biological pathway.

[1]  Enrico Macii,et al.  Algebric Decision Diagrams and Their Applications , 1997, ICCAD '93.

[2]  Yi Zhang,et al.  Dual-processor parallelisation of symbolic probabilistic model checking , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

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

[4]  Massoud Pedram,et al.  Stochastic modeling of a power-managed system: construction and optimization , 1999, ISLPED '99.

[5]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

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

[7]  Holger Hermanns,et al.  A Markov Chain Model Checker , 2000, TACAS.

[8]  Enrico Macii,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[9]  Peter W. Glynn,et al.  Computing Poisson probabilities , 1988, CACM.

[10]  Christel Baier,et al.  Model Checking Continuous-Time Markov Chains by Transient Analysis , 2000, CAV.

[11]  Robert K. Brayton,et al.  Verifying Continuous Time Markov Chains , 1996, CAV.

[12]  David Anthony Parker,et al.  Implementation of symbolic model checking for probabilistic systems , 2003 .

[13]  Christel Baier,et al.  Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.

[14]  Christel Baier,et al.  Model checking performability properties , 2002, Proceedings International Conference on Dependable Systems and Networks.

[15]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[16]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[17]  Jan J. M. M. Rutten,et al.  Mathematical techniques for analyzing concurrent and probabilistic systems , 2004, CRM monograph series.

[18]  António Pacheco,et al.  Model checking expected time and expected reward formulae with random time bounds , 2006, Comput. Math. Appl..

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

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

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

[22]  Joost-Pieter Katoen,et al.  Faster and Symbolic CTMC Model Checking , 2001, PAPM-PROBMIV.

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

[24]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[25]  P. Buchholz.  Exact and ordinary lumpability in finite Markov chains , 1994, Journal of Applied Probability.

[26]  Mihalis Yannakakis,et al.  Verifying temporal properties of finite-state probabilistic programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[27]  Joost-Pieter Katoen,et al.  A Markov reward model checker , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[28]  Sandeep K. Shukla,et al.  Using probabilistic model checking for dynamic power management , 2005, Formal Aspects of Computing.

[29]  Joost-Pieter Katoen,et al.  Towards Model Checking Stochastic Process Algebra , 2000, IFM.

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

[31]  Vitaly Shmatikov,et al.  Analysis of probabilistic contract signing , 2002, J. Comput. Secur..

[32]  Boudewijn R. Haverkort,et al.  Performance of computer communication systems - a model-based approach , 1998 .

[33]  Christel Baier,et al.  On the Logical Characterisation of Performability Properties , 2000, ICALP.

[34]  Luca Benini,et al.  A survey of design techniques for system-level dynamic power management , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[35]  Ling Cheung.  Randomized Wait-Free Consensus Using an Atomicity Assumption , 2005, OPODIS.

[36]  Joost-Pieter Katoen,et al.  Discrete-Time Rewards Model-Checked , 2003, FORMATS.

[37]  Christel Baier,et al.  Simulation for Continuous-Time Markov Chains , 2002, CONCUR.

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

[39]  Edmund M. Clarke.  Automatic verification of finite-state concurrent systems , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[40]  Adnan Aziz,et al.  It Usually Works: The Temporal Logic of Stochastic Systems , 1995, CAV.

[41]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[42]  Marta Z. Kwiatkowska,et al.  Probabilistic model checking of complex biological pathways , 2008, Theor. Comput. Sci..

[43]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[44]  Gianfranco Ciardo,et al.  Logic and stochastic modeling with S m A r T , 2006, Perform. Evaluation.

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

[46]  Luca Benini,et al.  Policy optimization for dynamic power management , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[47]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[48]  Conrado Daws,et al.  Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM , 2002, International Journal on Software Tools for Technology Transfer.

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

[50]  António Pacheco,et al.  Model Checking CSL until Formulae with Random Time Bounds , 2002, PAPM-PROBMIV.

[51]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

[52]  Wan Fokkink,et al.  Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM , 2006, J. Univers. Comput. Sci..

[53]  Marta Z. Kwiatkowska,et al.  Performance analysis of probabilistic timed automata using digital clocks , 2003, Formal Methods Syst. Des..

[54]  Reinhard German,et al.  Performance analysis of communication systems - modelling with non-Markovian stochastic Petri nets , 2000, Wiley-Interscience series in systems and optimization.

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

[56]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[57]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

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