Determination of minimal cut sets of a complex fault tree

被引:13
作者
Fard, NS
机构
关键词
fault tree; modules; cut sets; path sets;
D O I
10.1016/S0360-8352(97)00041-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Minimum cut sets are commonly obtained for evaluation of large fault trees. The number of minimum cut sets usually increases with the size of trees and this leads to al complexity in the evaluation of a fault tree. Modules of fault trees could be developed to reduce the size of trees and simplify the quantitative analysis. This paper will discuss procedures for developing modules, and methods for finding the minimum cut sets of a fault tree. (C) 1997 Elsevier Science Ltd.
引用
收藏
页码:59 / 62
页数:4
相关论文
共 10 条
[1]  
BIRNBAUM ZW, 1965, SIAM J APPL MATH, V13, P442
[2]  
Chatterjee P., 1975, RELIABILITY FAULT TR, V8, P101
[3]  
DUTUIT Y, 1996, IEEE T RELIAB, V45, P136
[4]  
Fussell J.B., 1972, AM NUCL SOC T, V15, P262
[5]  
GARRIBBA S, 1975, EUR5481CMF
[6]   FINDING MODULES IN FAULT-TREES [J].
KOHDA, T ;
HENLEY, EJ ;
INOUE, K .
IEEE TRANSACTIONS ON RELIABILITY, 1989, 38 (02) :165-176
[7]   FAULT TREE ANALYSIS, METHODS, AND APPLICATIONS - A REVIEW [J].
LEE, WS ;
GROSH, DL ;
TILLMAN, FA ;
LIE, CH .
IEEE TRANSACTIONS ON RELIABILITY, 1985, 34 (03) :194-203
[8]   MODULARIZING, MINIMIZING, AND INTERPRETING THE K-AND-H FAULT-TREE [J].
LOCKS, MO .
IEEE TRANSACTIONS ON RELIABILITY, 1981, 30 (05) :411-415
[9]   DECOMPOSITION METHODS FOR FAULT TREE ANALYSIS [J].
ROSENTHAL, A .
IEEE TRANSACTIONS ON RELIABILITY, 1980, 29 (02) :136-138
[10]   MODULARIZING AND MINIMIZING FAULT-TREES [J].
WILSON, JM .
IEEE TRANSACTIONS ON RELIABILITY, 1985, 34 (04) :320-322