Downloaded from https://www.everyspec.com -MI 7SI97 (E: Fourth Reduction of Logic Chart IN O-fJ----iJ- OUT i ! i I NO 20 OOUT 4 (G) Final Reduction of Logic Chart ~Series combinations are I .out-of-n'F; use Eq. 8-5 Parallel combinations are I .out-of-n:G, use Eq. 8-3. Find the system reliability and unreliability. In this kind of diagram, success is a continuous path from input to output. FIGURE 8-1. Logic Diagrams for Example No. 1(cont'd) I there are 34 = 81 possible combinations. In However, the events in the Table are all mutu- order to simplify Table 8-1, the capacitor ally exclusive whereas the events in parenthe- numbers are listed at the top of each column, ses in Eq. 8-16 are nut.
and an "o", "s", or "g" put in the column for It takes but little imagination to realize each event. An "f" indicates Failed for the that this approach can get out of hand with network; a blank indicates Good. It is failed if very little complication of the network or (l and 2 are short) U (3 and 4 are short) U 11 ey te and 4 are short) U (3 and 2 are short) U (1 system. and 3 are open) U (2 and 4 are open). Tabk 8-5 CUT SETS 8-1 is long and tedious.
The events can be put in more symbol notation and give the same A cut set is an event (subset of the sample results, i.e..A tseisaevn(sbeofheaml space) such that when it occurs, the system F = (1sn2s)U(3l4, 5 ;)U(isn4s)U(2s 5 03 s ) fails in the indicated failure mode. A minimal cut set is a cut set such that the elimination of U(loў33o)U(2oN4o) (8-16) any element renders it no longer a cut stut. r 8-4