Dual-Processor Parallelisation of Symbolic Probabilistic Model Checking

Authors:
Marta Kwiatkowska;David Parker;Yi Zhang;Rashid Mehmood
Affiliations:
University of Birmingham;University of Birmingham;University of Birmingham;University of Cambridge
Venue:
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Year:
2004

Citing 0
Cited 4

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

Formal Methods in System Design
Grid-Level Computing Needs Pervasive Debugging

GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Quantitative Analysis With the Probabilistic Model Checker PRISM

Electronic Notes in Theoretical Computer Science (ENTCS)
Stochastic model checking

SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe the dual-processor parallelisation of a symbolic (BDD-based) implementation of probabilistic model checking. We use multi-terminal BDDs, 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.