Scribd
Upload
28 views

BDD - Binary Decision Diagram: Rico Lirio and Edgar Aguilar

The document discusses Binary Decision Diagrams (BDDs), which provide a graphical representation for analyzing logic trees. It outlines that a BDD is assembled from a logic tree in a bottom-up recursive fashion using logic gates. Nodes are combined according to the gates' logic operations. The example shows a BDD constructed for the logic expression A.C + D using AND, OR, and terminal nodes. BDDs allow identifying disjoint failure paths and their probabilities.

Uploaded by

Karen Zolina Lirio
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
28 views

BDD - Binary Decision Diagram: Rico Lirio and Edgar Aguilar

The document discusses Binary Decision Diagrams (BDDs), which provide a graphical representation for analyzing logic trees. It outlines that a BDD is assembled from a logic tree in a bottom-up recursive fashion using logic gates. Nodes are combined according to the gates' logic operations. The example shows a BDD constructed for the logic expression A.C + D using AND, OR, and terminal nodes. BDDs allow identifying disjoint failure paths and their probabilities.

Uploaded by

Karen Zolina Lirio
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 9

BDD – Binary Decision

Diagram
Rico Lirio and Edgar Aguilar
• Evaluation of Logic Trees :
– Boolean Algebra Analysis of Logic Trees
– Truth Table or Combinatorial Technique for Evaluation of Logic
Trees
– Binary Decision Diagram (BDD)

• Outline of discussion:
– What is BDD?
– Assembly procedure
• Logic OR
• Logic AND
• Combination
– Example
– Advantages
– Application Software
What is BDD?
• BDD stands for Binary Decision Diagram is a
new logic manipulation procedure for fault trees
• It is in reality is a graphical representation of the
tree logic.
• The BDD used for logic tree analysis is referred
to as the ROBDD or reduced ordered BDD (i.e.,
minimal form in which the events appear in the
same order at each path.
Assembly procedure
TOP
The BDD is assembled
using the logic tree
recursively in a bottom-up
fashion
+ D

A B A C
Single node BDD

A
Each of the basic event in
the fault has an
0 1
associated single node
Child node Child node BDD.
TOP
Each basic event will be
combined according to
the logic of the
corresponding gate
+ D

A+B
A B A C
A + B

0 1 0 1 Determine which of the


two events will be the root
node.
Note: Root node is always the
first in the relation
Apply the intersection
operation of the two Root Node
events. A

A+B
B +0 1+ B
A + B =

0 1 0 1 0 1 0 1
Child node

BDD for OR
Gate A

= 1
B

Since: 0+X=X and 1+X=1

0 1
TOP
A.C
A C

0 1 0 1

Root Node
A + D

A B A C

C .0 Child node
1. C
=

BDD for
A AND Gate
0 1 0 1

= C
0

Since: 0.X=0 and 1.X=X


1
0
A.C +D A
+ Root Node
A D
+
= D C
0 C 0 1
1
0 1
A C D 0 1 Child node
D

0 1
A BDD for A.C + D
A

C
D +0 C + D
=

D 1

0 1 0 1 0 1

0 1
Determine the disjoint
combination of events,
those failure paths that
A.C +D
will lead to bottom node 1 A

C
+

D 1

A C D 0 1
Total # of disjoint combinations = 3

Disjoint paths Probability of failure


AC Pr(A)Pr(C)
ACD Pr(A)(1-Pr(C))Pr(D)
AD (1-Pr(A))Pr(D)

You might also like