Time-bounded model checking of infinite-state continuous-time Markov chains

The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for concurrent system designs making it possible to model check such properties. In this paper, we focus on probabilistic timing properties of infinite-state CTMCs, expressible in continuous stochastic logic (CSL). Such properties comprise important dependability measures, such as timed probabilistic reachability, performability, survivability, and various availability measures like instantaneous availabilities, conditional instantaneous availabilities and interval availabilities. Conventional model checkers explore the given model exhaustively which is not always possible either due to state explosion or because the model is infinite. This paper presents a method that only explores the infinite (or prohibitively large) model up to a finite depth, with the depth bound being computed on-the-fly. We provide experimental evidence showing that our method is effective.

[1]  M. D. Beaudry,et al.  Performance-Related Reliability Measures for Computing Systems , 1978, IEEE Transactions on Computers.

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

[3]  Joost-Pieter Katoen,et al.  Model-checking large structured Markov chains , 2003, J. Log. Algebraic Methods Program..

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

[5]  William H. Sanders,et al.  Adaptive uniformization : technical details , 1993 .

[6]  Marta Z. Kwiatkowska,et al.  Stochastic Model Checking , 2007, SFM.

[7]  Christel Baier,et al.  Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes , 2005, Theor. Comput. Sci..

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

[9]  Lijun Zhang,et al.  Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains , 2009, Fundam. Informaticae.

[10]  Joost-Pieter Katoen,et al.  Three-Valued Abstraction for Continuous-Time Markov Chains , 2007, CAV.

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

[12]  Christel Baier,et al.  Comparative branching-time semantics for Markov chains , 2005, Inf. Comput..

[13]  Roger B. Sidje,et al.  Inexact Uniformization Method for Computing Transient Distributions of Markov Chains , 2007, SIAM J. Sci. Comput..

[14]  BaierChristel,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2003 .

[15]  BaierChristel,et al.  Comparative branching-time semantics for Markov chains , 2005 .

[16]  Lijun Zhang,et al.  INFAMY: An Infinite-State Markov Model Checker , 2009, CAV.

[17]  H. Hermanns,et al.  Probabilistic Model Checking Modulo Theories , 2007 .

[18]  Boudewijn R. Haverkort,et al.  CSL Model Checking Algorithms for Infinite-State Structured Markov Chains , 2007, FORMATS.

[19]  Holger Hermanns,et al.  Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[20]  Joost-Pieter Katoen,et al.  Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability , 2005, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[21]  Brian Munsky,et al.  A multiple time interval finite state projection algorithm for the solution to the chemical master equation , 2007, J. Comput. Phys..

[22]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[23]  Håkan L. S. Younes.  Ymer: A Statistical Model Checker , 2005, CAV.

[24]  W. J. Anderson.  Continuous-Time Markov Chains: An Applications-Oriented Approach , 1991 .

[25]  John F. Meyer.  Performability evaluation: where it is and what lies ahead , 1995, Proceedings of 1995 IEEE International Computer Performance and Dependability Symposium.

[26]  Nico M. van Dijk.  On the finite horizon Bellman equation for controlled Markov jump models with unbounded characteristics: existence and approximation , 1988 .

[27]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

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

[29]  M.D. Beaudry,et al.  PERFORMANCE RELATED RELIABILITY MEASURES FOR COMPUTING SYSTEMS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[30]  Boudewijn R. Haverkort,et al.  CSL model checking algorithms for QBDs , 2007, Theor. Comput. Sci..

[31]  Armin Biere,et al.  Bounded model checking , 2003, Adv. Comput..

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

[33]  Christel Baier,et al.  Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes , 2005, TACAS.

[34]  Aad P. A. van Moorsel,et al.  Performability evaluation concepts and techniques , 1993 .

[35]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[36]  P J Goss,et al.  Quantitative modeling of stochastic systems in molecular biology by using stochastic Petri nets. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[39]  Mieke Massink,et al.  Basic Observables for Probabilistic May Testing , 2007 .

[40]  M. Khammash,et al.  The finite state projection algorithm for the solution of the chemical master equation. , 2006, The Journal of chemical physics.

[41]  M. Khammash,et al.  Computation of switch time distributions in stochastic gene regulatory networks , 2008, 2008 American Control Conference.

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

[43]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

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

[45]  Winfried K. Grassmann.  Transient solutions in markovian queueing systems , 1977, Comput. Oper. Res..

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

[47]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

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

[49]  J. R. Jackson.  Networks of Waiting Lines , 1957 .

[50]  Enrico Tronci,et al.  Bounded probabilistic model checking with the murφ verifier , 2004 .

[51]  Joost-Pieter Katoen,et al.  On the use of model checking techniques for dependability evaluation , 2000, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000.

[52]  Boudewijn R. Haverkort,et al.  Model checking for survivability! , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).