Distributed disk-based algorithms for model checking very large Markov chains

In this paper we present data structures and distributed algorithms for CSL model checking-based performance and dependability evaluation. We show that all the necessary computations are composed of series or sums of matrix-vector products. We discuss sparse storage structures for the required matrices and present efficient sequential and distributed disk-based algorithms for performing these matrix-vector products. We illustrate the effectivity of our approach in a number of case studies in which continuous-time Markov chains (generated in a distributed way from stochastic Petri net specifications) with several hundreds of millions of states are solved on a workstation cluster with 26 dual-processor nodes. We show details about the memory consumption, the solution times, and the speedup. The distributed message-passing algorithms have been implemented in a tool called PARSECS, that also takes care of the distributed Markov chain generation and that can also be used for distributed CTL model checking of Petri nets.

[1]  Peter G. Harrison,et al.  A probabilistic dynamic technique for the distributed generation of very large state spaces , 2000, Perform. Evaluation.

[2]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

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

[4]  Boudewijn R. Haverkort,et al.  On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

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

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

[7]  Iain S. Duff,et al.  Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .

[8]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[9]  Michael Allen Heroux,et al.  A proposal for a sparse blas toolkit , 1992 .

[10]  Alexander Bell.  Distributed Evaluation of Stochastic Petri nets , 2004, MMB.

[11]  Gianni Conte,et al.  Analysis of large GSPN models: a distributed solution tool , 1997, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models.

[12]  G. Ciardo,et al.  ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS , 1996 .

[13]  Kishor S. Trivedi,et al.  A Decomposition Approach for Stochastic Reward Net Models , 1993, Perform. Evaluation.

[14]  Marta Z. Kwiatkowska,et al.  Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling , 2002, PAPM-PROBMIV.

[15]  David M. Nicol,et al.  Distributed State Space Generation of Discrete-State Stochastic Models , 1995, INFORMS J. Comput..

[16]  Holger Hermanns,et al.  On the use of MTBDDs for performability analysis and verification of stochastic systems , 2003, J. Log. Algebraic Methods Program..

[17]  M. Siegle,et al.  Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains , 1999 .

[18]  Anthony Skjellum,et al.  A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard , 1996, Parallel Comput..

[19]  Boudewijn R. Haverkort,et al.  Sequential and distributed model checking of Petri nets , 2005, International Journal on Software Tools for Technology Transfer.

[20]  Peter G. Harrison,et al.  Probability, Parallelism and the State Space Exploration Problem , 1998, Computer Performance Evaluation.

[21]  William H. Sanders,et al.  An Efficient Disk-Based Tool for Solving Large Markov Models , 1998, Perform. Evaluation.

[22]  Ian T. Foster,et al.  Designing and building parallel programs - concepts and tools for parallel software engineering , 1995 .

[23]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[24]  S TrivediKishor,et al.  A decomposition approach for stochastic reward net models , 1993 .

[25]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[26]  Graham Horton,et al.  State space construction and steady-state solution of GSPNs on a shared-memory multiprocessor , 1997, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models.

[27]  Boudewijn R. Haverkort,et al.  Serial And Parallel Out-Of-Core Solution of Linear Systems arising from Generalised Stochastic Petri Nets , 2007 .

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

[29]  Marta Z. Kwiatkowska,et al.  A Symbolic Out-of-Core Solution Method for Markov Models , 2002, Electron. Notes Theor. Comput. Sci..

[30]  Ian Foster,et al.  Designing and building parallel programs , 1994 .

[31]  William Gropp,et al.  User's Guide for mpich, a Portable Implementation of MPI Version 1.2.2 , 1996 .