Presentation 2006-07-14
Minimal Cut Sets of FT with Priority AND Gates
Tetsushi YUGE, Shigeru YANAGI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A priority AND gate is a representative logic gate of dynamic fault trees. An algorithm to obtain the minimal cut sets/minimal cut sequences is proposed in this paper when a fault tree is constructed with AND gates, OR gates and priority AND gates, and has some repeated basic events. The algorithm is a top-down algorithm similar to FATRAM[7] which is known as an efficient algorithm to obtain minimal cut sets of static fault trees. The minimal cut sets/sequences are obtained easily by the algorithm. All steps of the algorithm are illustrated by examples. The top event probability of a fault tree with priority AND gates is calculated by using the minimal cut sets/sequences.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) dynamic fault tree / priority AND gate / repeated event / minimal cut set / minimal cut sequence
Paper # R2006-20
Date of Issue

Conference Information
Committee R
Conference Date 2006/7/7(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Reliability(R)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Minimal Cut Sets of FT with Priority AND Gates
Sub Title (in English)
Keyword(1) dynamic fault tree
Keyword(2) priority AND gate
Keyword(3) repeated event
Keyword(4) minimal cut set
Keyword(5) minimal cut sequence
1st Author's Name Tetsushi YUGE
1st Author's Affiliation Dept. of Electrical and Electronic Engineering, National Defense Academy()
2nd Author's Name Shigeru YANAGI
2nd Author's Affiliation Dept. of Electrical and Electronic Engineering, National Defense Academy
Date 2006-07-14
Paper # R2006-20
Volume (vol) vol.106
Number (no) 159
Page pp.pp.-
#Pages 6
Date of Issue