A Unifying Theoretical Background for Some Bdd-based Data Structures

Authors:
Christoph Meinel;Anna Slobodová
Affiliations:
FB IV – Informatik, Universität Trier, D–54 286 Trier, Germany. E-mail: meinel@uni-trier.ed;ITWM – Trier, Bahnhof Str. 30-32, D–54 202 Trier, Germany. E-mail: anna@itwm-trier.fhg.de
Venue:
Formal Methods in System Design
Year:
1997

Citing 10
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Using if-then-else DAGs for multi-level logic minimization

Proceedings of the decennial Caltech conference on VLSI on Advanced research in VLSI
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
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
Improving the Variable Ordering of OBDDs Is NP-Complete

IEEE Transactions on Computers
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's

IEEE Transactions on Computers
On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science

A Comparison of Free BDDs and Transformed BDDs

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, we propose a general concept (denoted by TBDD) forBoolean functions manipulation that is based on cube transformations. Thebasic idea is to manipulate a Boolean function by converting it by means ofa cube transformation into a function that can be efficiently representedand manipulated in terms of ordered binary decision diagrams (OBDDs). Weshow that the new concept unifies several BDD–based data structuresconsiderably, and simplifies their manipulation to work with the simple andwell–understood data struture of OBDDs. This is especially importantfor practical applications.Further, to give an example of how TBDDs open new ways in the search forefficient data structures for Boolean functions, we discuss the datastructure of typed kFBDDs.