Ordered Binary Decision Diagrams In Electronic Design Automation: Foundations, Applications and Innovations

Ordered Binary Decision Diagrams In Electronic Design Automation: Foundations, Applications and Innovations (2002)

Cached

Download Links

[www.informatik.uni-trier.de]

by Randal E. Bryant , Christoph Meinel

Citations:

2 - 2 self

BibTeX

@MISC{Bryant02orderedbinary,
    author = {Randal E. Bryant and Christoph Meinel},
    title = {Ordered Binary Decision Diagrams In Electronic Design Automation: Foundations, Applications and Innovations},
    year = {2002}
}

Bookmark

OpenURL

Abstract

Ordered Binary Decision Diagrams (OBDDs) play a key role in the automated synthesis and formal verification of digital systems. They are the state-of-the-art data structure for representing switching functions in various branches of electronic design automation. In the following we discuss the properties of this data structure, characterize its algorithmic behaviour, and describe some prominent applications.

Citations

8880	Computers and Intractability: A Guide to the Theory of NPCompleteness - Garey, Johnson - 1979
2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
1207	Symbolic Model Checking - McMillan - 1993
792	Symbolic boolean manipulation with ordered binary decision diagrams - Bryant - 1992
386	Dynamic Variable Ordering for Ordered Binary Decision Diagrams - Rudell - 1993
312	Binary decision diagrams - Akers - 1978
226	Algebraic decision diagrams and their applications - Bahar, Frohm, et al. - 1997
224	On the complexity of VLSI implementations and graph representation of boolean functions with application to integer multiplication - BRYANT - 1991
146	Symbolic model checking with partitioned transition relations - Burch - 1991
144	Improving the variable ordering of OBDDs is NP-complete - Bollig, Wegener - 1996
119	Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation - Minato, Ishiura, et al. - 1990
117	Zero-suppressed BDDs for set manipulation in combinatorial problems - Minato - 1993
106	On variable ordering of binary decision diagrams for the application of multi-level logic synthesis - Fujita, Matsunaga, et al. - 1991
91	Verification of arithmetic circuits with binary moment diagrams - Bryant, Chen - 1995
90	Supowit : Finding an optimal variable ordering for binary decision diagrams - Friedman, J - 1990
83	Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams - Drechsler, Sarabi, et al. - 1994
67	Multilevel logic synthesis based on functional decision diagrams - Kebschull, Schubert, et al. - 1992
44	The complexity of the optimal variable ordering problems of shared binary decision diagrams - Tani, Hamaguchi, et al. - 1993
41	EVBDD-based algorithms for integer linear programming, spectral transformation and function decomposition - Lai, Pedram, et al. - 1994
21	Mod2-OBDDs: A Data Structure that generalizes EXOR-sum-of-products and Ordered Binary Decision Diagrams - Gergov, Meinel - 1996
20	Using lower bounds during dynamic BDD minimization - Drechsler, unther, et al. - 2001
19	Algorithms and Data Structures in VLSI Design - Meinel, Theobald - 1998
18	Modified Branching Programs and Their Computational Power, volume 370 - Meinel - 1989
18	Speeding Up Variable Reordering of OBDDs - Meinel, Slobodova - 1997
18	Local encoding transformations for optimizing OBDDrepresentations of finite state machines - Meinel, Theobald - 1996
18	On the existence of polynomial time approximation schemes for OBDDMinimization - Sieling - 1998
17	Linear sifting of decision diagrams - Meinel, Theobald - 1997
17	On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams - Waack - 1997
16	Verification of synchronous sequential machines using symbolic execution without building their state diagrams - Coudert, Madre, et al. - 1990
15	Ecient model checking by automated ordering of transition relation partitions - Geist, Beer - 1994
15	Sample method for minimization of obdds - Meinel, Slobodov'a - 1998
14	Sampling schemes for computing OBDD variable orderings - Jain, Adams, et al. - 1998
10	Logic Veri cation using Binary Decision Diagrams in a Logic Synthesis Environment - Malik, Wang, et al. - 1988
8	OBDD-based Boolean manipulation in CAD beyond current limits - Meinel, Slobodov'a - 1995
8	Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs - Meinel - 1993
6	The implicit set paradigm: A new approach to finite state system verification - Coudert, Madre - 1995
6	Probabilistic veri of Boolean functions - Jain, Bitner, et al. - 1992
6	OBDDs - A BDD Structure for Probabilistic Veri - Meinel, Sack - 1998
5	A uni framework for the formal veri of sequential circuits - Coudert, Madre - 1990
4	Probabilistic veri of multiple-valued functions - Dubrova, Sack - 1999
4	Speeding up symbolic model checking by accelerating dynamic variable reordering - Meinel, Stangier - 2000
3	Lazy group sifting for ecient symbolic state traversal of FSMs - Higuchi, Somenzi - 1999
2	Application driven variable reordering and an example implementation in reachability analysis - Meinel, Slobodova - 1999
1	Spectral transforms for large Boolean functions with application to technology mapping - Clarc, McMillen, et al. - 1993
1	Evaluation and improvements of Boolean comparision method based on binary decision diagrams - Fujita, Fujisawa, et al. - 1988
1	Accessibility of information on the web", Nature, Volume 400, Number 6740 - Lawrence, Gilles - 1999
1	Algorithmic considerations for parity-OBDD reordering - Meinel - 1999
1	Function decomposition and synthesis using linear sifting - Meinel, Theobald - 1998
1	WWW.BDD-Portal.Org - an electronic basis for cooperative research - Meinel - 2000
1	Mod-p decision diagrams: A data-structure for multiple-valued functions - Meinel - 2000