loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'04)
Dual-Processor Parallelisation of Symbolic Probabilistic Model Checking
Volendam, The Netherlands
October 04-October 08
ISBN: 0-7695-2251-3
Marta Kwiatkowska, University of Birmingham
David Parker, University of Birmingham
Yi Zhang, University of Birmingham
Rashid Mehmood, University of Cambridge
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.
Citation:
Marta Kwiatkowska, David Parker, Yi Zhang, Rashid Mehmood, "Dual-Processor Parallelisation of Symbolic Probabilistic Model Checking," mascots, pp.123-130, 12th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.