Boolean manipulation with free BDD's. First experimental results

Abstract

It is shown that Free Binary Decision Diagrams (FBDD's), with respect to a predefined type, provide a canonical representation and allow efficient solutions of the basic tasks in Boolean manipulation in a similar manner to the well-known OBDD's. However, in contrast to OBDD's, the FBDD's allow more succinct representations of Boolean functions. For experimentation we have used an FBDD-package and the types worked with are tree-based. Using different type-creating heuristics, we compare the size of FBDD-representations of some ISCAS benchmarks with the size of their OBDD-representations.<>