DocumentCode
2925777
Title
Approximate fault-tree analysis without cut sets
Author
Schneeweiss, Winfried G.
Author_Institution
Dept. of Comput. Eng., FernUniversitat, Hagen, Germany
fYear
1992
fDate
21-23 Jan 1992
Firstpage
370
Lastpage
375
Abstract
It is shown that a rather efficient approximate fault tree analysis is possible on the basis of the Shannon decomposition. The main advantages are: (1) no preprocessing is necessary to determine all the mincuts; (2) the maximum error can be prespecified; and (3) noncoherent systems and systems with dependent component states can be treated. The main disadvantage is the fact that the cutting off of certain subtrees of the decomposition tree (for upper bound results) may need some trial and error test calculations
Keywords
failure analysis; Shannon decomposition; approximate fault tree analysis; dependent component state systems; error test calculations; maximum error; noncoherent systems; Arithmetic; Binary trees; Boolean functions; Computer errors; Delay; Ducts; Fault trees; Input variables; Testing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Reliability and Maintainability Symposium, 1992. Proceedings., Annual
Conference_Location
Las Vegas, NV
Print_ISBN
0-7803-0521-3
Type
conf
DOI
10.1109/ARMS.1992.187850
Filename
187850
Link To Document