Presentation 2010-12-17
On Sum of Disjoint Products Method considering Cut Sequences
Taijirou YONEDA, Tetsushi YUGE, Nobuyuki TAMURA, Shigeru YANAGI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In the case of transforming the minimal cut sequences(MCSSs) into disjoint cut sequences, the number of disjoint sequences is dependent on how the MCSSs are applied to a sum of disjoint products method. In this paper, we consider a condition which minimizes the number of disjoint cut sequences. Mainly, we take into account the number of events which are contained in an MCSS and the number of repeated events included in all MCSSs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Dynamic FT / Priority AND Gate / Cut Sequence / Minimal Cut Sequence Set
Paper # R2010-38
Date of Issue

Conference Information
Committee R
Conference Date 2010/12/10(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) On Sum of Disjoint Products Method considering Cut Sequences
Sub Title (in English)
Keyword(1) Dynamic FT
Keyword(2) Priority AND Gate
Keyword(3) Cut Sequence
Keyword(4) Minimal Cut Sequence Set
1st Author's Name Taijirou YONEDA
1st Author's Affiliation National Defense Academy()
2nd Author's Name Tetsushi YUGE
2nd Author's Affiliation National Defense Academy
3rd Author's Name Nobuyuki TAMURA
3rd Author's Affiliation National Defense Academy
4th Author's Name Shigeru YANAGI
4th Author's Affiliation National Defense Academy
Date 2010-12-17
Paper # R2010-38
Volume (vol) vol.110
Number (no) 345
Page pp.pp.-
#Pages 5
Date of Issue