Professional Documents
Culture Documents
Boolean Algebra Applications (Reliability of Circuits)
Boolean Algebra Applications (Reliability of Circuits)
Boolean Algebra Applications (Reliability of Circuits)
ALGEBRA
APPLICATIONS
RELIABILITY OF
CIRCUITS
Boolean Algebra Applications
Boolean Algebra
Applications
Boolean
Algebra
Appl
Boolean Algebra
Applications
Boolean
Algebra
Appl
Boolean Algebra
Applications
Boolean
Algebra
Appl
Boolean Algebra
Applications
Boolean
Algebra
Appl
Boolean Algebra
Applications
Boolean
Algebra
Appl
Boolean Algebra
Applications
Boolean
Algebra
Appl
10
10
11
12
F & M METHOD
L. Fratta & V. Montanari
Discuss Boolean algebra
approach for
determining terminal
reliability
Boolean Algebra Applications
13
Algorithm
Determine all paths
Write down the corresponding
Boolean expression
Determine non-overlapping
simplification
Transform into mathematical
expression
Substitute reliability values
Boolean Algebra Appl
14
Algorithm
Step 1: Let S be the set of all simple
paths between the terminal nodes.
Construct a Boolean sum of products
f, where each product corresponds
to a path S and whose factors are
exactly the non-complemented
variables corresponding to the arcs
in the path
Boolean Algebra Appl
15
Algorithm
Let P = 0
Step 2: If f has no terms, stop
Step 3: Select any term A of f
Step 4: Let A be the arithmetic
monomial which is equivalent to A
16
Algorithm
Let P = P + A
_
Step 5: Let A f f and reduce f to a
sum of products.
Go to step 2.
Boolean Algebra
Applications
Boolean
Algebra
Appl
17
17
Example:
18
19
20
21
22
23
24
25
26
K- Map Method
27
28
29
Example:
30
31
32
33
34
35
36
37
38
39
40
X1X2
41
X3X4
42
X1X4X5
43
X2X3X5
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
Questions ?
Boolean Algebra
Applications
Boolean
Algebra
Appl
62
62