A Comparison of Free BDDs and Transformed BDDs

Authors:
Detlef Sieling;Ingo Wegener
Affiliations:
FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund, Germany. sieling@ls2.cs.uni-dortmund.de;FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund, Germany. wegener@ls2.cs.uni-dortmund.de
Venue:
Formal Methods in System Design
Year:
2001

Citing 10
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

IEEE Transactions on Computers
Graph driven BDDs—a new data structure for Boolean functions

Theoretical Computer Science
Efficient OBDD-based boolean manipulation in CAD beyond current limits

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Linear sifting of decision diagrams

DAC '97 Proceedings of the 34th annual Design Automation Conference
A Unifying Theoretical Background for Some Bdd-based Data Structures

Formal Methods in System Design
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's

IEEE Transactions on Computers
Some heuristics for generating tree-like FBDD types

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ordered binary decision diagrams (OBDDs) introduced by Bryant (IEEE Trans. on Computers, Vol. 35, pp. 677–691, 1986) have found a lot of applications in verification and CAD. Their use is limited if the OBDD size of the considered functions is too large. Therefore, a variety of generalized BDD models has been presented, among them FBDDs (free BDDs) and TBDDs (transformed BDDs). Here the quite tight relations between these models are revealed and their advantages and disadvantages are discussed.