A fast bottom-up algorithm for computing the cut sets of noncoherent fault trees

Technical Report · Sun Nov 01 00:00:00 EST 1987

OSTI ID:5824104

Corynen, G C

An efficient procedure for finding the cut sets of large fault trees has been developed. Designed to address coherent or noncoherent systems, dependent events, shared or common-cause events, the method - called SHORTCUT - is based on a fast algorithm for transforming a noncoherent tree into a quasi-coherent tree (COHERE), and on a new algorithm for reducing cut sets (SUBSET). To assure sufficient clarity and precision, the procedure is discussed in the language of simple sets, which is also developed in this report. Although the new method has not yet been fully implemented on the computer, we report theoretical worst-case estimates of its computational complexity. 12 refs., 10 figs.

• Research Organization: Lawrence Livermore National Lab., CA (USA)
• DOE Contract Number: W-7405-ENG-48
• OSTI ID: 5824104
• Report Number(s): UCRL-53828; ON: DE88003741
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
FAULT TREE ANALYSIS
ALGORITHMS
FLOWSHEETS
DIAGRAMS
MATHEMATICAL LOGIC
SYSTEM FAILURE ANALYSIS
SYSTEMS ANALYSIS
990230* - Mathematics & Mathematical Models- (1987-1989)
990220 - Computers
Computerized Models
& Computer Programs- (1987-1989)