Algorithm for finding minimal cut sets in a fault tree

Reliability Engineering and System Safety

Volumn 53, Issue 1, 1996, Pages 67-71

  Rosenberg, Ladislav ^a  

^a Physics and Informatics   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DYNAMIC PROGRAMMING; SAFETY FACTOR; SET THEORY;

FAULT TREE; INDUSTRIAL SYSTEMS; MINIMAL CUT SETS; SAFETY ANALYSIS;

FAILURE ANALYSIS;

EID: 0030189290     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/0951-8320(96)00034-8     Document Type: Article

References (6)

1. Patterson-Hine, F.A. & Koen, B.V., Direct evaluation of fault trees using object-oriented programming techniques. IEEE Trans. Computers, 38 (1989) 186-192.
2. Antoine, R., New algorithms for fault trees analysis. Reliab. Engng System Safety, 40 (1993) 203-211.
3. Randal, E.B., Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers, C-35 (1986) 677-691.
4. Coudert, O. & Jean, Ch.M., MetaPrime: an interactive fault-tree analyzer. IEEE Trans. Reliab., 43 (1994) 121-127.
5. Vatn, J., Finding minimal cut sets in a fault tree. Reliab. Engng System Safety, 36 (1992) 59-62.
6. Fussell, J. B., Henry, E. B. & Marshall, N. H., MOCUS - a computer program to obtain minimal sets from fault trees. Aerojet Nuclear Company, 1974.