Within the research field of BDD-based data structures for Boolean functions data structures, for the representation and computation of Boolean (i.e., 0-1-valued) functions have been designed and analyzed . The various practical applications of such data structures, e.g., in CAD systems for circuit design or in tools for the formal verification of communication protocols, sequential systems or electronic circuits made optimization and compactification of such structures a very worthwhile aim of research.
| Optimizing OBDDs | Development of new global reordering strategies for minimization of OBDDs. |
| More powerful BDD concepts | Free BDDs |
| BDDs in applications | Accelerating the Variable Reordering Process OHO: OBDD-Heuristics Online: BDD-heuristic evaluation via WWW |