{"title":"Fault tree models for the analysis of complex computer-based systems","authors":"L. Pullum, J. Dugan","doi":"10.1109/RAMS.1996.500663","DOIUrl":null,"url":null,"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.","PeriodicalId":393833,"journal":{"name":"Proceedings of 1996 Annual Reliability and Maintainability Symposium","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1996 Annual Reliability and Maintainability Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAMS.1996.500663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47
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.