Downloaded from https://www.everyspec.com A 706-197 Case 5. 1-out-of-n:F (series) A 17 =A 1 5 A 16 (8-12a) R 1 7 = l-R (8-12b) f = R, R 2 ... Rn (8-5) The fourth reduction is as follows (Fig. Case 6. 1-out-of-n:F (series), all R, = R 8-1(D) to Fig. 8-1(E)): (8-6) R 1 s = R 1 3 R 1 7 (8-13a) Ale = 1- s (8-13b) The formulas for k-out-of-n systems when all The fifth reduction is as follows (Fig. R, * R are not tractable. They are derived 8-1(E) to Fig. 8-1(F)): generally as shown in par. 8-4. 8-3 COMBINATIONS OF SERIES-PARAL- RS = R 12 R(- LEL ELEMENTS P 19 = 1 - R 9 (8-14b) Many systems can be considered as made The final reduction is as follows (Fig.
up of series-parallel combinations of elements. 8-1(F) to Fig. 8-1(G)): A convenient technique for reliability calcula- tions is to reduce each simple combination of Ro = R 1 R 19 (8-15a) series or parallel elements to a single element R20 = 1 -R2 (8-15b) with the reliability of the combination. Exam- ple No. 1 (Fig. 8-1) shows how the reduction Thus a series of series-parallei reductions is performed. Fig. 8-1(A) shows the original has solved the example problem in Fig. 8-1. logic chart. Each block is an element and is There is no good reason to combine all the numbered. Equivalent blocks are numbered formulas into one expression; it would be further. tedious, long, and cumbersome.
The first reduction takes place as follows Not all systems can be reduced by this (Fig. 8-1(A) to Fig. 8-1(B)): technique, but a great many cre. If the switching is not perfect, one of the other R 7 Rg R 9 (8-7a) techniques is better-if for no other reason that not all failure events are likely to be 14 R 14 (8-7b) s-independent. R 15 RIO R 1 1 (8-8a) 8-4 EVENT ANALYSIS RI 1-R, 5 (8-8b) When logic charts are not series-parallel R 12 = R 2 R 3 (8-9a) arrangements, the analysis can proceed by R12= 1 - R 12 (8-9b) looking at all possible events, classifying them into appropriate subsets (e.g., system-good, R 13 = R?
4 R 5 (8-10a) system-degraded, system-failure-ty pe-1, sys- R 1 3 = 1-R13 (8-10b) tem-failure-type-2)., Then the probability of each subset is calculated by the rules for The second reduction is as follows (Fig. evaluating probabilities of combinations of 8-1(B) to Fig. 8-1(C)):' events (Chapter 3). Logic charts generally are drawn from a R 16 = R 6 R 14 (8 11a) physical diagram and a knowledge of the re- Ri = 1--R,6 (8-11b) quirements for success. In some cases, as in Example No. 2 (Fig. 8-2), it is too compli- The third reduction is as follows (Fig. cated to draw logic diagrams, instead the 8-1(C) to Fig. 8-1(D)): events are listed.
There are three possible states of each capacitor and four capacitors: 8-2