Efficient Implementation of OBDDs
So far, we have mainly considered structural properties of ordered binary decision diagrams. Several of these properties, like the linear-time equivalence test, already indicate the suitability of OBDDs in the context of Boolean manipulation. However, as the efficiency of all OBDD-based applications depends almost exclusively on the efficiency of the basic OBDD operations, the demands on the performance of these operations are very high. Hence, much research effort has been spent on transforming the basic OBDD concept into fast and memory-efficient implementations.
KeywordsHash Function Hash Table Efficient Implementation Garbage Collection Binary Decision Diagram
Unable to display preview. Download preview PDF.
- The key ideas for the efficient implementation of OBDDs mostly go back to Brace, Rudell, and Bryant [BRB90]. Complemented edges were proposed by Karplus [Kar88] and by Madre and Billon [MB88]. The three presented OBDD packages are publicly available. The OBDD package of Long originated from the work [Lon93]. The CUDD package, the latest of these three packages, can be found at the Internet address given in reference [Som96b].Google Scholar