Dual-processor parallelisation of symbolic probabilistic model checking

We describe the dual-processor parallelisation of a symbolic (BDD-based) implementation of probabilistic model checking. We use multi-terminal BDDs (binary decision diagrams), which allow a compact representation of large, structured Markov chains. We show that they also provide a convenient block decomposition of the Markov chain which we use to implement a parallelised version of the Gauss-Seidel iterative method. We provide experimental results on a range of case studies to illustrate the effectiveness of the technique, observing an average speed-up of 1.8 with two processors. Furthermore, we present an optimisation for our method based on preconditioning.

[1]  W. Knottenbelt,et al.  Hypergraph-based parallel computation of passage time densities in large semi-Markov models , 2004 .

[2]  Gianfranco Ciardo,et al.  Distributed and Structured Analysis Approaches to Study Large and Complex Systems , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[3]  Sandeep K. Shukla,et al.  Evaluating the reliability of defect-tolerant architectures for nanotechnology with probabilistic model checking , 2004, 17th International Conference on VLSI Design. Proceedings..

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

[5]  Daniel B. Szyld,et al.  Experimental study of parallel iterative solutions of Markov chains with block partitions , 1999 .

[6]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[7]  William John Knottenbelt,et al.  Parallel performance analysis of large Markov models , 1999 .

[8]  Marta Z. Kwiatkowska,et al.  Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM , 2001, CAV.

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

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

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

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

[13]  Åke Björck,et al.  Numerical Methods , 1995, Handbook of Marine Craft Hydrodynamics and Motion Control.

[14]  Marta Kwiatkowska,et al.  An Efficient BDD-Based Implementation of Gauss-Seidel for CTMC Analysis , 2003 .

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

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

[17]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

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

[19]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[20]  David Parker,et al.  Symbolic Representations and Analysis of Large Probabilistic Systems , 2004, Validation of Stochastic Systems.

[21]  Hiroshi Niki,et al.  The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method , 2004 .

[22]  Gene H. Golub,et al.  Scientific computing: an introduction with parallel computing , 1993 .