Zero-suppressed binary Decision Diagrams (ZDDs) have emerged as an efficient way of solving problems in set theory. This tutorial presents ZDDs and assumes that the reader is familiar with Boolean algebra and Binary Decision Diagrams, without prior knowledge of ZDDs. The case studies include the computation of the union of two sets, the generation of all primes of a Boolean function, and the co...

Data deduplication is one of the fascinating features of any cloud computing storage service which is generally realized as Cross User Data Deduplication (CUDD). Although it provides optimization which is challenging to achieve due to security concerns. A User always concerns about privacy and confidentiality of the data from honest but curious insiders. Encryption introduces new challenge like...

In this paper, we present CacBDD, a new efficient BDD (Binary Decision Diagrams) package. It implements a dynamic cache management algorithm, which takes account of the hit-rate of computed table and available memory. Experiments on the BDD benchmarks of both combinational circuits and model checking show that CacBDD is more efficient compared with the state-of-the-art BDD package CUDD.

binary decision diagram (bdd) is a data structure proved to be compact in representation and efficient in manipulation of boolean formulas. using binary decision diagram in network reliability analysis has already been investigated by some researchers. in this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using cudd - colorado univer...

Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of protocol and circuit designs increases. This paper addresses this issue by introducing three techniques based on working set control. First, we introduce a novel BDD construction algorithm based on partial breadth-first ex...

We describe an algebra of Edge-Valued Decision Diagrams (EVMDDs) to encode arithmetic functions and its implementation in a model checking library along with state-of-the-art algorithms for building the transition relation and the state space of discrete state systems. We provide efficient algorithms for manipulating EVMDDs and give upper bounds of the theoretical time complexity of these algor...