Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Binary decision diagram

Known as: Binary Decision Diagrams, Branching program, Branching programs 
In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more… Expand
Wikipedia

Related topics

Related topics

47 relations
And-inverter graphAutomated theorem provingBinary moment diagramBoolean satisfiability problem
Expand

Broader (2)

Boolean algebraModel checking

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
An Efficient Binary-Decision-Diagram-Based Approach for Network Reliability and Sensitivity Analysis
  • Liudong Xing
  • IEEE Transactions on Systems, Man, and…
  • 2008
    • Corpus ID: 24693524
Reliability and sensitivity analysis is a key component in the design, tuning, and maintenance of network systems. Tremendous… Expand
  • figure 2
  • figure 1
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
K-Terminal Network Reliability Measures With Binary Decision Diagrams
We present a network decomposition method using binary decision diagrams (BDD), a state-of-the-art data structure to encode, and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Event-tree analysis using binary decision diagrams
This paper is concerned with ETA (event-tree analysis) where the branch point event causes are defined using fault trees… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
In this paper, we discuss the use of binary decision diagrams to represent general matrices. We demonstrate that binary decision… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Dynamic variable ordering for ordered binary decision diagrams
The Ordered Binary Decision Diagram OBDI)) has A proven useful in many applications as an e cient data structure for reprtxenting… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Logic verification using binary decision diagrams in a logic synthesis environment
The results of a formal logic verification system implemented as part of the multilevel logic synthesis system MIS are discussed… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Finding the Optimal Variable Ordering for Binary Decision Diagrams
The ordered binary decision diagram is a canonical representation for Boolean functions, presented by Bryant as a compact… Expand
  • figure 2
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Binary Decision Diagrams
  • S. Akers
  • IEEE Transactions on Computers
  • 1978
    • Corpus ID: 21028055
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary… Expand
  • figure 1
  • figure 7
  • figure 8
  • figure 6
  • figure 9
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE