On application of multi-rooted binary decision diagrams to probabilistic model checking

Authors:
Dmitry Bugaychenko
Affiliations:
Saint-Petersburg State University, Russia
Venue:
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Year:
2012

Citing 5
Cited 0

Shared binary decision diagram with attributed edges for efficient Boolean function manipulation

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Improving the Variable Ordering of OBDDs Is NP-Complete

IEEE Transactions on Computers
Symbolic Model Checking

Symbolic Model Checking
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the applicability of multi-rooted binary decision diagrams for the probabilistic model checking. The symbolic probabilistic model checking involves manipulation of functions and matrices with the values in [0,1], and multi-terminal binary decision diagrams, sparse matrices, and combinations thereof are used to represent these objects. We propose algorithms for representing these objects by means of multi-rooted binary decision diagrams when a function with the values in [0,1] is approximated by a set of Boolean functions. Each Boolean function is represented by a binary decision diagram and being combined together these diagrams form a mutli-rooted binary decision diagram. Presented experimental results show that this approach allows for the model checking for large problems with a smaller memory footprint, compared to the use of the multi-terminal binary decision diagrams.