Package: PBF

CUDD Package

Description

CUDD is a package for the manipulation of:

Binary Decision Diagrams;
Algebraic Decision Diagrams (aka Multi-Terminal Decision Diagrams);
Zero-Suppressed Binary Decision Diagrams.

CUDD employs depth-first manipulation. It uses a single, direct-mapped, hash-based cache as computed table for most operations. Some operations use dedicated lossless computed tables that are disposed of once the operation is completed.

As most decision diagram packages, CUDD relies on garbage collection. Unlike many packages, though, it keeps track of what nodes are "dead" and uses this information to decide when garbage collection should be invoked.

CUDD can check how much memory is available (under Unix, with getrusage) and tries to decide the sizes of the data structures accordingly. Currently, the policy used by CUDD is reward-based: the size of the computed table is increased if there is enough memory, and the hit rate is sufficiently high.

CUDD provides a wide variety of functions (over 300 "external" functions) and a large selection of reordering methods. Further information can be found here .