Modularizing and Minimizing Fault Trees

IEEE Transactions on Reliability

Volumn R-34, Issue 4, 1985, Pages 320-322

  Wilson, J M ^a  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Boolean method; Fault tree; Minimization; Module

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER PROGRAMS;

FAULT TREES;

RELIABILITY THEORY;

EID: 0022137430     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1985.5222175     Document Type: Article

References (9)

1. M. O. Locks, “Modularizing, minimizing, and interpreting the K & H fault-tree”, IEEE Trans. Reliability, vol R-30, 1981 Dec, pp 411–415.
2. P. Chatterjee, “Modularization of fault trees: A method to reduce the cost of analysis”, Reliability and Fault Tree Analysis, SIAM, 1975, pp 101–137.
3. Z. W. Birnbaum, J. P. Esary, “Modules of coherent binary systems”, SIAM J. Applied Mathematics, vol 13, 1965, pp 442–462.
4. J. M. Wilson, “Acompact compact method for the minimization of Boolean polynomials”, Int. J. Comp. Maths., vol 12, 1982, pp 3–12.
5. H. Kumamoto, E. J. Henley, Author Reply #2, IEEE Trans. Reliability, vol R-29, 1980 Jun, pp 133–134.
6. IEEE Rosenthal, “Decomposition methods for fault 136–138. analysis”, IEEE Trans. Reliability, vol R-29, 1980 Jun, pp 136–138.
7. R. B. Worrell, “SETS Reference Manual”, Sandia National Laboratories, New Mexico, USA, 1984.
8. B. Putney, H. R. Kirch, J. M. Koren, “WAMCUT II, A fault tree evaluation program”, Electric Power Research Institute, NP-2421, 1982.
9. R.B. Worrell, D.W. Stack, “Using SETS to obtain prime implicants of noncoherent fault trees”, IEEE Trans. Reliablity, vol R-30, 1981 Jun, pp 98-100.