- D Consider The Fault Tree Representation Using Boolean Algebra T P1 2e1 3a S1 E2 2 S2 E2 3p2 2e1 1 (48.62 KiB) Viewed 30 times
(d) Consider the fault tree representation using Boolean algebra: T = (P1 +2E1 +3A+ (S1 + E2)2 · (S2 + E2)). (3P2 +2E1 +
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
(d) Consider the fault tree representation using Boolean algebra: T = (P1 +2E1 +3A+ (S1 + E2)2 · (S2 + E2)). (3P2 +2E1 +
(d) Consider the fault tree representation using Boolean algebra: T = (P1 +2E1 +3A+ (S1 + E2)2 · (S2 + E2)). (3P2 +2E1 + A+ (Si + E2) · (S2 + E2)?), . (i) using reduction rule of Boolean algebra to simplify such representation, (ii) specify its mini- mal path set(s) (mps(s)). Note that T denotes failure of system and its mps(s) are by OR gates.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!