A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking

2015/01/01

Authors:

Published in: SETTA pp 35–51

DOI: 10.1007/978-3-319-25942-0_3

Paper

Abstract:

Symbolic data structures using Binary Decision Diagrams (BDDs) have been successfully used in the last decades to analyse large systems. While various BDD and MTBDD packages have been developed in the community, the CUDD package remains the default choice of most of the symbolic (probabilistic) model checkers. In this paper, we provide the first comparative study of the performance of various BDD/MTBDD packages for this purpose. We provide experimental results for several well-known probabilistic benchmarks and study the effect of several optimisations. Our experiments show that no BDD package dominates on a single core, but that parallelisation yields significant speedups.

BibTeX entry:

@inproceedings{Setta2015,
 author = {Tom van Dijk and Ernst Moritz Hahn and David N. Jansen and Yong Li and Thomas Neele and Mariƫlle Stoelinga and Andrea Turrini and Lijun Zhang},
 booktitle = {SETTA},
 doi = {10.1007/978-3-319-25942-0_3},
 pages = {35--51},
 publisher = {Springer},
 series = {LNCS},
 title = {{A Comparative Study of {BDD} Packages for Probabilistic Symbolic Model Checking}},
 volume = {9409},
 year = {2015}
}