Finding Modules in Fault Trees

IEEE Transactions on Reliability

Volumn 38, Issue 2, 1989, Pages 165-176

  Kohda, Takehisa ^a   Henley, Ernest J ^b   Inoue, Koichi ^a  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF HOUSTON   (United States)

Author keywords

Fault tree; Hierarchical representation; Module; Noncoherence

Indexed keywords

MATHEMATICAL TECHNIQUES--TREES; PROBABILITY; RELIABILITY--COMPUTER AIDED ANALYSIS; SYSTEMS SCIENCE AND CYBERNETICS--HIERARCHICAL SYSTEMS;

FAULT TREES; GATE EVENTS; HIERARCHICAL DECOMPOSITION; LARGE FAULT TREES; NONCOHERENT FAULT TREES; SOFTWARE PACKAGE MOCUS;

RELIABILITY THEORY;

EID: 0024684627     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.31101     Document Type: Article

References (7)

1. P. Chatterjee, “Modularization of fault trees: A method to reduce the cost of analysis”, Reliability and Fault Tree Analysis, SIAM, 1975, pp. 101–137.
2. Z.W. Birnbaum, J.P. Esary, “Modules of coherent binary systems”, SIAM J. Applied Mathematics, vol 13, 1965, pp. 442–462.
3. M.O. Locks, “Modularizing, minimizing, and interpreting the K & H fault-tree”, IEEE Trans. Reliabilty, vol R-30, 1981 Dec, pp. 411–415.
4. A Rosenthal, “Decomposition methods for fault tree analysis”, IEEE Trans. Reliability, vol R-29, 1980 Jun, pp. 136–138.
5. J.M. Wilson, “Modularizing and minimizing fault trees”, IEEE Trans. Reliability, vol R-34, 1985 Oct, pp. 320–322.
6. The MOCUS program is the IBM PC version sold by COADE/McGraw-Hill; 8550 Katy Freeway; Houston, Texas 77024 USA.
7. M.O. Locks, “Fault trees, prime implicants and noncoherence”; E.I. Ogunbiyi, “Author reply #1”; H. Kumamoto, E.J. Henley, “Author reply #2”; M.O. Locks, “Rebuttal”; IEEE Trans. Reliability, vol R-29, 1980 Jun, pp. 130–135.