Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
A modular approach for analyzing static and dynamic fault trees
Edit
A modular approach for analyzing static and dynamic fault trees   (Citations: 76)
BibTex | RIS | RefWorks Download
Three commonly used analytical techniques for reliability evaluation are fault trees, binary decision diagrams (BDD) and Markov chains. Each of these techniques have advantages and disadvantages and the choice depends on the system being modeled. Fault trees have been found to be the most popular choice in terms of building an analytical model of a system. It provides a compact representation of the system and is easily understood by humans. However, fault trees lack the modeling power and solution time increases exponentially with the size of the system being modeled. In this paper, we present a new exciting hybrid approach, called the modular approach, for the efficient analysis of both static and dynamic fault trees. It provides a combination of BDD solution for static fault trees and Markov chain solution for dynamic fault trees coupled with the detection of independent subtrees. The algorithms used for modularization, integrating the results obtained from the separate solution of the independent modules (subtrees) and incorporating coverage modeling are discussed in detail in this paper. The modular approach is applied to an example system to demonstrate the potential of this research
Conference: Reliability and Maintainability Annual Symposium - RAMS , pp. 57-63, 1997
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...However, it is well known that the Markov-based methods suffer from the state space explosion problem, which often leads to models that are computationally intensive and even intractable [27]...

    Liudong Xing, et al. Combinatorial Algorithm for Reliability Analysis of Multistate Systems...

    • ...Recent advances in analyzing static fault trees include Binary Decision Diagrams (BDD) [2], efficient and linear-time modularization methods [3], and these presented in [4, 5]...
    • ...Therefore, these gates are not only used in research-oriented projects [4, 5], but also incorporated into the commercial fault tree software recently, e.g., Relex Fault Tree [7]...
    • ...Once dynamic fault trees (or dynamic modules as in [5]) are converted to Markov models, the state probability can be evaluated by solving the Markov models...
    • ...Dugan et al. [5] proposed a modularzatioin-based method which takes the advantages of recent research in finding the modules in fault trees with a linear time [3] as well as the new approach of solving static fault trees using BDD [2]...

    Jian Sun, et al. A numerical model with age reduction factor for warm spare

    • ...It was generalized in [5] for Fault Trees having both static and dynamic gates...

    Olexandr Yevkin. An improved modular approach for dynamic fault tree analysis

    • ...Note that in the presence of inter-component dependencies, techniques such as modularization [29] can be used to form -independent modules...

    Akhilesh Shrestha, et al. Decision Diagram Based Methods and Complexity Analysis for MultiState ...

    • ...The quantitative analysis of the DFT consists in exploding minimal modules [10] of dynamic gates into their state-space representation, and computing numerically the related occurrence probability by means of a Continuous Time Markov Chain [8], [12], thus assuming exponential time-to-failure distributions...
    • ...In the case of DFTs, the determination of the failure probability of the from the failure probabilities of the basic events is determined numerically by developing dynamic modules into the corresponding Markov chain [12]...

    Guillaume Merle, et al. Probabilistic Algebraic Analysis of Fault Trees With Priority Dynamic ...

Order by:

Citations (76)

Share this on | Contribute to Academic