Downloaded from https://www.everyspec.com AMCP M17 CAPACTOR BRIDGE Capacitors can fail open or short. The network is good as long as it is neither r-,on nor short. i 0 implies "open circuit of capacitor i" i, Implies "short ci, cuit of capacitor i' i. implies "good cpacitor i FIGURE 8-2. Physical Diagram for Example No. 2 In the example from par. 8-4, Jr , :.8-2 Re/iabi;ity, contains further information and and Eq. 8-16, each of the six event n pareai- references on finding minimal cut sets for theses in Eq. 8-16 is a minimal cut set. The systems; references are also made there to Pr(F } in Eq.
8-16 can be calculated by an automated methods of finding all minimal cut iterative procedure using Eq. 2-20 which pro- sets for a fault tree. vides a series of upper and lower bounds on the Pr{F}. 8-6 MAJORITY VOTING The first upper bound is the sum of the probabilities of each of the six events in pa- In majority-voting redundancy the proper rentheses in Eq. 8-16. The first lower bound is output of the system is presumed to be the found by subtracting (from the first upper output of the majority of the individual logic bound) the sum of the probabilities of the 15 elements which feed the voter (Ref. 3). The unions of each pair of the six events.
The output is determined by the voter, which second upper bound is found by adding (to decides what the majority of the elements in- the first lower bound) the sum of the proba- dicate.i. The system gives the correct output bilities of the 20 unions of each triplet of the ,hen less than half of the elements have six events. As shown in Eq. 2-20, the unions failed and when the voter is good. are taken two, then three, then four, then Case 7. Simple majority voting five, and finally six at a time. The odd ones (one, three, five) are added, the even ones n R .' (8-17) (two, four, six) are subtracted. An example of 07 = (n' i R, ( the procedure is shown in Ref.
I; a FOR- I~l I TRAN program for performing this calcula- where tion is shown in Ref. 2. Even though the principles involved are n = number of logic elements straightforward, implementing them on any n, = greatest "integer n/2" reasorably sized system can be very tedious = 8-reliability of the voter and complicdted. Chqtnter 7 "Cause-Consequence Charts RI = s-reiability of a logic element (and Fault Trees)" of Part Two, Design for R 1 = 1 - RI 8-5