Binary Decision Diagram

A binary decision diagram is a directed acyclic graph that consists of nodes and edges. It deals with Boolean functions. A binary decision diagram consists of a set of decision nodes, starting at the root node at the top of the decision diagram. Each decision node contains two outgoing branches, one is a high branch and the other is a low branch. These branches may be represented as solid and dotted lines, respectively. The binary decision diagram contains high and low branches that are used to connect decision nodes with each other to create decision paths. The high and low branches of the final decision nodes are connected to either a high- or low-terminal node, which represents the output of the function. The development of examples of binary decision diagrams is presented in text and in figures. Shannon decomposition is explained. The conversion of a fault tree to a binary decision diagram is shown.

[1]  John D. Andrews,et al.  An ordering heuristic to develop the binary decision diagram based on structural importance , 2001, Reliab. Eng. Syst. Saf..

[2]  Arash Habibi Lashkari,et al.  Binary Decision Diagram (BDD) , 2009, 2009 International Conference on Future Computer and Communication.

[3]  Ali M. Rushdi.  Symbolic Reliability Analysis with the Aid of Variable-Entered Karnaugh Maps , 1983, IEEE Transactions on Reliability.

[4]  Ondrej Lhoták,et al.  Program analysis using binary decision diagrams , 2006 .

[5]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[6]  Christoph Meinel,et al.  Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications , 2012 .

[7]  John D. Andrews,et al.  A fault tree analysis strategy using binary decision diagrams , 2002, Reliab. Eng. Syst. Saf..

[8]  Beate Bollig,et al.  Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams , 1997, Theory of Computing Systems.

[9]  Olivier P. M. Nusbaumer,et al.  Analytical solutions of linked fault tree probabilistic risk assessments using binary decision diagrams with emphasis on nuclear safety applications , 2007 .

[10]  Monica S. Lam,et al.  Context-sensitive pointer analysis using binary decision diagrams , 2007 .

[11]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[12]  Christopher M. Bishop,et al.  Neural networks for pattern recognition , 1995 .

[13]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[14]  Alexander Vardy,et al.  Ordered Binary Decision Diagrams and Minimal Trellises , 1999, IEEE Trans. Computers.

[15]  Jørn Lind-Nielsen,et al.  BuDDy : A binary decision diagram package. , 1999 .

[16]  Yuan-Shun Way,et al.  A simple component-connection method for building binary decision diagrams encoding a fault tree , 2000, Reliab. Eng. Syst. Saf..