Abstract
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.
Similar content being viewed by others
References
Ajmone Marsan M, Conte G, Balbo G (1984) A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Trans Comp Syst 2(2):93–122
Ajmone Marsanan M, Balbo G, Conte G, Donatelli S, Franceschinis G (1995) Modelling with Generalized Stochastic Petri Nets, Wiley Series in Parallel Computing. Wiley
Allmaier S, Kowarschik M, Horton G (1997) State space construction and steady-state solution of GSPNs on a shared-memory multiprocessor. In: Proceedings of the 7th International Workshop on Petri Nets and Performance Models. pp 112–121
Baier C, Haverkort B, Hermanns H, Katoen J (2003) Model-checking algorithms for continuous-Time Markov Chains. IEEE Trans Softw Eng 29(6):524–541
Bell A (2004) Distributed evaluation of stochastic Petri nets. Ph.D. thesis, Rheinisch-Westfalische Technischen Hochschule Aachen. ISBN-Nr.: 3-930376-36-9
Bell A, Haverkort B (2001) Serial and parallel out-of-core solution of linear systems arising from generalised stochastic Petri net models. In: Tentner A (ed) Proceedings high performance computing symposium HPC 2001. pp 242–247
Bell A, Haverkort B (2005) Sequential and distributed model checking of Petri nets. Softw Tools Technol Transf 7(1):43–60
Carney S, Heroux M, Li G (1993) A proposal for a sparse BLAS toolkit. Technical Report TR/PA/92/90 (Revised), CERFACS, Toulouse, France
Ciardo G, Tilgner M (1996) On the use of Kronecker Operators for the Solution of Generalized Stochastic Petri Nets, ICASE, No. 96-35
Ciardo G, Fricks R, Muppala J, Trivedi K (1994) SPNP Reference Guide Version 3.1
Ciardo G, Gluckman J, Nicol D (1998) Distributed state space generation of discrete-state stochastic models. INFORMS J Comput 10(1):82–93
Ciardo G, Trivedi K (1993) A decomposition approach for stochastic reward Net Models. Perform Eval 18(3):37–59
Cormen T, Leiserson C, Rivest R (1990) Introduction to Algorithms. MIT Press
Deavours D, Sanders W (1998) An efficient disk-based tool for solving large Markov Models. Perform Eval 33(1):67–84
Dutt I, Grimes R, Lewis J (1992) ‘Users’ Guide for the Harwell-Boeing Sparse Matrix Collection (Release I). Technical Report RAL 92-086, Rutherford Appleton Laboratory, Chilton, Oxon, England
Forum MPI (1994) MPI: A message-passing interface standard. Technical Report UT-CS-94-230, University of Tennessee Computer Science Department
Foster I (1995) Designing and building parallel programs. Addison-Wesley
Gropp W, Lusk E, Doss N, Skjellum A (1996) A high-performance, portable implementation of the MPI message passing interface standard. Parallel Comput 22(6):789–828
Gropp WD, Lusk E (1996) User's Guide for \({\tt mpich}\), a portable implementation of MPI. Mathematics and Computer Science Division, Argonne National Laboratory. ANL-96/6
Haverkort B (1998) Performance of computer communication systems: A model-based approach. Wiley
Haverkort B, Bell A, Bohnenkamp H (1999) On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri Nets. In: Proceedings of the 8th International Workshop on Petri Nets and Performance Models. pp 12–21
Hermanns H, Kwiatkowska M, Norman G, Parker D, Siegle M (2003) On the use of MTBDDs for performability analysis and verication of stochastic systems. J Log Algeb Progr: Special Issue on Probabilistic Techniques for the Design and Analysis of Systems 56(1–2):23–67
Hermanns H, Meyer-Kayser J, Siegle M (1999) Multi-terminal binary decision diagrams to represent and analyse continuous time markov chains. In: Plateau B, Stewart W, Silva M (eds) Proceedings of the 3rd Int. workshop on the numerical solution of Markov chains. pp 188–207
Knottenbelt W, Harrison P (1999) Distributed disk-based solution techniques for large Markov models. In: Proceedings of the 3rd International meeting on the numerical solution of Markov chains. pp 58–75
Knottenbelt W, Harrison P, Mestern M, Kritzinger P (2000) A probabilistic dynamic technique for the distributed generation of very large state spaces. Perform Eval 39(1–4):127–148
Knottenbelt W, Mestern M, Harrison P, Kritzinger P (1998) Probability, Parallelism and the State Space Exploration Problem. In: Puigjaner R, Savino N, Serra B (eds) Computer performance evaluation, Vol 1469 of Lecture Notes in Computer Science. pp 165–179
Kwiatkowska M, Mehmood R (2002) Out-of-core solution of large linear systems of equations arising from stochastic modelling. In: Proc PAPM-PROBMIV, Vol. 2399 of Lecture Notes in Computer Science. pp 135–151
Kwiatkowska M, Mehmood R, Norman G, Parker D (2002) A symbolic out-of-core solution method for markov models. Electr Notes Theor Comput Sci 68(4)
Kwiatkowska M, Parker D, Zhang Y, Mehmood R (2004) Dual-processor parallelisation of symbolic probabilistic model checking. In: Proceedings IEEE MASCOTS. pp 123–130
Marenzoni P, Caselli S, Conte G (1997) Analysis of large GSPN models: a distributed solution tool. In: Proceedings of the 7th International workshop on petri nets and performance models. pp 122–131
Stewart W (1994) Introduction to the mumerical solution of Markov chains. Princeton University Press
Acknowledgments
The work presented in this paper has largely been performed in the period 1999–2003 when the authors were working in the Department of Computer Science of the RWTH Aachen, Germany. The work was supported by the DFG (projects HA2666/1-1,2).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bell, A., Haverkort, B.R. Distributed disk-based algorithms for model checking very large Markov chains. Form Method Syst Des 29, 177–196 (2006). https://doi.org/10.1007/s10703-006-0007-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10703-006-0007-0