DocumentCode
1687400
Title
Fault tree models for the analysis of complex computer-based systems
Author
Pullum, Laura L. ; Dugan, Joanne Bechta
Author_Institution
Quality Res. Assoc. Inc., Dacula, GA, USA
fYear
1996
Firstpage
200
Lastpage
207
Abstract
In this paper we present a synthesis of several techniques into a single methodology that can solve both dynamic and static fault trees, and which is applicable to the analysis of hardware, software and humanware in complex computer-based systems. The methodology combines those techniques into a unified fault tree methodology which we call SHADE Tree. SHADE Tree provides a high-level decomposition of the system fault tree model into the static and dynamic fault trees. Static fault trees, which contain only traditional fault tree gates (i.e. AND, OR, R-of-N, etc.) are solved using the binary decision diagram approach. Dynamic fault trees, which contain at least one special dynamic gate as well as traditional fault tree gates, are solved using Markov methods
Keywords
Markov processes; fault tolerant computing; fault trees; reliability; software fault tolerance; Markov methods; SHADE Tree; binary decision diagram approach; computer-based systems; dependability analysis; dynamic fault trees; fault tolerant computer systems; fault tree models; hardware analysis; humanware analysis; software analysis; static fault trees; Binary decision diagrams; Boolean functions; Data structures; Failure analysis; Fault tolerance; Fault tolerant systems; Fault trees; Hardware; Redundancy; Software quality;
fLanguage
English
Publisher
ieee
Conference_Titel
Reliability and Maintainability Symposium, 1996 Proceedings. International Symposium on Product Quality and Integrity., Annual
Conference_Location
Las Vegas, NV
ISSN
0149-144X
Print_ISBN
0-7803-3112-5
Type
conf
DOI
10.1109/RAMS.1996.500663
Filename
500663
Link To Document