Conference Paper

Combining Static/Dynamic Fault Trees and Event Trees Using Bayesian Networks.

DOI: 10.1007/978-3-540-75101-4_10 Conference: Computer Safety, Reliability, and Security, 26th International Conference, SAFECOMP 2007, Nuremberg, Germany, September 18-21, 2007.
Source: DBLP

ABSTRACT In this study, an alternative approach for combining Fault Trees (FT) and Event Trees (ET) using capabilities of Bayesian
networks (BN) for dependency analysis is proposed. We focused on treating implicit and explicit weak s-dependencies that may
exist among different static/dynamic FTs related to an ET. In case of combining implicit s-dependent static FTs and ET that
combinatorial approaches fail to get the exact result, the proposed approach is accurate and more efficient than using Markov
Chain (MC) based approaches. In case of combining implicit weak s-dependent dynamic FTs and ET where the effect of implicit
s-dependencies have to be manually inserted into the MC, the proposed approach is more efficient for getting an acceptable

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Reasoning with incomplete and unreliable information is a central characteristic of decision making, for example in industry, medicine and finance. Bayesian networks provide a theoretical framework for dealing with this uncertainty using an underlying graphical structure and the probability calculus. Bayesian networks have been successfully implemented in areas as diverse as medical diagnosis and finance. We present a brief introduction to Bayesian networks for those readers new to them and give some pointers to the literature.
    Bayesian Networks: A Practical Guide to Applications, 03/2008: pages 1 - 13; , ISBN: 9780470994559
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the system-level interactions between component reliabilities. Dynamic fault trees have been shown particularly useful for reliability analysis of embedded computer systems. Dynamic fault trees are a superset of traditional (static) fault trees in that additional gates are used to model sequential behavior. DIFtree [1] is our fault tree methodology for the analysis of dynamic fault trees, effectively combining the best static fault tree solution technique (Binary Decision Diagrams) with Markov solution techniques for dynamic fault trees. DIFtree includes advanced techniques for modeling coverage; coverage modeling has been shown to be critical to the analysis of fault tolerant computer systems. DIFtree is based on a divideand -conquer technique for modularizing the system level fault tree into independent sub-trees; ...
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A module of a fault tree is a subtree whose terminal events do not occur elsewhere in the tree. Modules, which are independent subtrees, can be used to reduce the computational cost of basic operations on fault trees, such as the computation of the probability of the root event or the computation of the minimal cut sets. This paper presents a linear time algorithm to detect modules of a fault tree, coherent or not, that is derived from the Tarjan algorithm to find strongly connected components of a graph. The authors show, on a benchmark of real fault trees, that their method detects modules of trees with several hundred gates and events within few milliseconds on a personal computer
    IEEE Transactions on Reliability 10/1996; · 2.29 Impact Factor