You need JavaScript to view this

Users` manual for fault tree analysis code: CUT-TD

Technical Report:

Abstract

The CUT-TD code has been developed to find minimal cut sets for a given fault tree and to calculate the occurrence probability of its top event. This code uses an improved top-down algorithm which can enhance the efficiency in deriving minimal cut sets. The features in processing techniques incorporated into CUT-TD are as follows: (1) Consecutive OR gates or consecutive AND gates can be coalesced into a single gate. As a result, this processing directly produces cut sets for the redefined single gate with each gate not being developed. (2) The independent subtrees are automatically identified and their respective cut sets are separately found to enhance the efficiency in processing. (3) The minimal cut sets can be obtained for the top event of a fault tree by combining their respective minimal cut sets for several gates of the fault tree. (4) The user can reduce the computing time for finding minimal cut sets and control the size and significance of cut sets by inputting a minimum probability cut off and/or a maximum order cut off. (5) The user can select events that need not to be further developed in the process of obtaining minimal cut sets. This option can reduce  More>>
Authors:
Watanabe, Norio; [1]  Kiyota, Mikio
  1. Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment
Publication Date:
Jun 01, 1992
Product Type:
Technical Report
Report Number:
JAERI-M-92-089
Reference Number:
SCA: 990200; 220900; PA: JPN-92:011193; SN: 93000918598
Resource Relation:
Other Information: PBD: Jun 1992
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; 22 GENERAL STUDIES OF NUCLEAR REACTORS; FAULT TREE ANALYSIS; PROBABILISTIC ESTIMATION; MANUALS; C CODES; ALGORITHMS; EFFICIENCY; DATA PROCESSING; REACTOR ACCIDENTS; PROGRAMMING; COMPUTER PROGRAM DOCUMENTATION; 990200; 220900; MATHEMATICS AND COMPUTERS; REACTOR SAFETY
OSTI ID:
10111221
Research Organizations:
Japan Atomic Energy Research Inst., Tokyo (Japan)
Country of Origin:
Japan
Language:
Japanese
Other Identifying Numbers:
Other: ON: DE93753272; TRN: JP9211193
Availability:
OSTI; NTIS; INIS
Submitting Site:
JPN
Size:
57 p.
Announcement Date:
Jun 30, 2005

Technical Report:

Citation Formats

Watanabe, Norio, and Kiyota, Mikio. Users` manual for fault tree analysis code: CUT-TD. Japan: N. p., 1992. Web.
Watanabe, Norio, & Kiyota, Mikio. Users` manual for fault tree analysis code: CUT-TD. Japan.
Watanabe, Norio, and Kiyota, Mikio. 1992. "Users` manual for fault tree analysis code: CUT-TD." Japan.
@misc{etde_10111221,
title = {Users` manual for fault tree analysis code: CUT-TD}
author = {Watanabe, Norio, and Kiyota, Mikio}
abstractNote = {The CUT-TD code has been developed to find minimal cut sets for a given fault tree and to calculate the occurrence probability of its top event. This code uses an improved top-down algorithm which can enhance the efficiency in deriving minimal cut sets. The features in processing techniques incorporated into CUT-TD are as follows: (1) Consecutive OR gates or consecutive AND gates can be coalesced into a single gate. As a result, this processing directly produces cut sets for the redefined single gate with each gate not being developed. (2) The independent subtrees are automatically identified and their respective cut sets are separately found to enhance the efficiency in processing. (3) The minimal cut sets can be obtained for the top event of a fault tree by combining their respective minimal cut sets for several gates of the fault tree. (4) The user can reduce the computing time for finding minimal cut sets and control the size and significance of cut sets by inputting a minimum probability cut off and/or a maximum order cut off. (5) The user can select events that need not to be further developed in the process of obtaining minimal cut sets. This option can reduce the number of minimal cut sets, save the computing time and assists the user in reviewing the result. (6) Computing time is monitored by the CUT-TD code so that it can prevent the running job from abnormally ending due to excessive CPU time and produce an intermediate result. The CUT-TD code has the ability to restart the calculation with use of the intermediate result. This report provides a users` manual for the CUT-TD code. (author).}
place = {Japan}
year = {1992}
month = {Jun}
}