Modular techniques for dynamic fault tree-analysis

Patterson-Hine, F. A.; Dugan, J.B.

doi:10.1109/arms.1992.187849

Cited by 9 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…hierarchical) approaches have been developed and used with great effectiveness. The early application of modularised techniques to solve fault trees can be traced back to the 1990s [33], [34]. DIFtree [35], a modularisation technique for DFT analysis, follows the divide-and-conquer strategy to solve the DFTs by dividing the system-level DFTs into independent static and dynamic sub-trees.…”

Section: A Related Work and Motivationmentioning

confidence: 99%

A Hybrid Modular Approach for Dynamic Fault Tree Analysis

et al. 2020

View full text Add to dashboard Cite

Over the years, several approaches have been developed for the quantitative analysis of dynamic fault trees (DFTs). These approaches have strong theoretical and mathematical foundations; however, they appear to suffer from the state-space explosion and high computational requirements, compromising their efficacy. Modularisation techniques have been developed to address these issues by identifying and quantifying static and dynamic modules of the fault tree separately by using binary decision diagrams and Markov models. Although these approaches appear effective in reducing computational effort and avoiding state-space explosion, the reliance of the Markov chain on exponentially distributed data of system components can limit their widespread industrial applications. In this paper, we propose a hybrid modularisation scheme where independent sub-trees of a DFT are identified and quantified in a hierarchical order. A hybrid framework with the combination of algebraic solution, Petri Nets, and Monte Carlo simulation is used to increase the efficiency of the solution. The proposed approach uses the advantages of each existing approach in the right place (independent module). We have experimented the proposed approach on five independent hypothetical and industrial examples in which the experiments show the capabilities of the proposed approach facing repeated basic events and non-exponential failure distributions. The proposed approach could provide an approximate solution to DFTs without unacceptable loss of accuracy. Moreover, the use of modularised or hierarchical Petri nets makes this approach more generally applicable by allowing quantitative evaluation of DFTs with a wide range of failure rate distributions for basic events of the tree.INDEX TERMS Reliability analysis, fault tree analysis, dynamic fault trees, modularisation, petri nets.

show abstract

Section: A Related Work and Motivationmentioning

confidence: 99%

A Hybrid Modular Approach for Dynamic Fault Tree Analysis

et al. 2020

View full text Add to dashboard Cite

show abstract

“…In [12] a hierarchical, modular technique was used to analyze the hardware fault tolerance of the example FTPP system. Instead of converting the entire fault tree to an equivalent Markov chain for solution, only a small portion of the fault tree was converted to a Markov chain.…”

Section: A Modular Missionsmentioning

confidence: 99%

Reliability analysis of a hardware and software fault tolerant parallel processor

Dugan

Proceedings of IEEE 13th Symposium on Reliable Distributed Systems

Self Cite

View full text Add to dashboard Cite

Computer systems for critical applications must be designed to to tolerate software faults as well as hardware faults. A unified approach to tolerating hardware and software faults is characterized by classifying faults in terms of duration (transient or permanent) rather than source (hardware or software). Errors arising from transient faults can be handled through masking or voting, but errors arising from permanent faults require system reconfiguration t o bypass the failed component. Most errors which are caused by software faults can be considered transient, in that they are input dependent. Quantitative dependability analysis of systems which exhibit a unified approach to fault tolerance can be performed by a hierarchical combination of fault tree and Markov models. In this paper, a methodology for analyzing hardware and software fault tolerant systems is applied to the analysis of a hypothetical system, loosely based on the Fault Tolerant Parallel Processor (FTPP) [7]. The models considers both transient and permanent faults, hardware and software faults, unrelated and related software faults, automatic recovery and reconfiguration. The parameter values for the software part of the model are determined from an experimental implementation of an N-version programming application. The parameter values chosen for the hardware part of the model are considered fairly typical.of life, or severe economic or environmental damage. In order to meet stringent dependability requirements, fault tolerant computer systems often employ similar and dissimilar redundancy and complex recovery mechanisms to tolerate hardware and software faults [lo]. Dependability analysis of critical systems often requires a hierarchical approach combining several different modeling techniques. In this paper, we demonstrate such a hierarchical approach using Markov models, fault trees and several combinatorial equations to analyze a hypothetical fault tolerant system. We begin with a description of the system to be analyzed, and then proceed to develop the model incrementally. The resulting model is a combination of fault tree models for the analysis of software fault tolerance, a Markov model for the analysis of hardware fault tolerance, and several combinatorial equations to combine the analyses. Example System Description - FTPP clusterThe example system to be analyzed in this paper is a hypothetical FTPP [7] cluster which is designed to tolerate both hardware and software faults. The cluster consists of sixteen processing elements (PE), with four connected to each of four network elements (NE). The network elements are fully connected, and form a Byzantine Resilient core for the cluster. Four of the processors (one on each NE for Byzantine resilience), those labeled Q1, Q2, Q3 and Q4, form a

show abstract

Numerical simulation to reliability analysis of fault-tolerant repairable system

Liang

Hong

Zhang

et al. 2010

J. Shanghai Jiaotong Univ. (Sci.)

View full text Add to dashboard Cite

In the traditional method for the reliability analysis of fault-tolerant system, the system structure is described by means of binary decision diagram (BDD) and Markov process, and then the reliability indexes are calculated. However, as the size of system augments, the size of state space will increase exponentially. Additionally, Markov approach requires that the failure and repair time of the components obey an exponential distribution. In this study, by combining dynamic fault tree (DFT) and numerical simulation based on the minimal sequence cut set (MSCS), a new method to evaluate reliability of fault-tolerant system with repairable components is proposed. The method presented does not depend on Markov model, so that it can effectively solve the problem of the state-space combination explosion. Moreover, it is suitable for systems whose failure and repair time obey an arbitrary distribution. Therefore, our method is more flexible than the traditional method. At last, an example is given to verify the method.

show abstract

Modular techniques for dynamic fault tree-analysis

Cited by 9 publications

References 6 publications

A Hybrid Modular Approach for Dynamic Fault Tree Analysis

A Hybrid Modular Approach for Dynamic Fault Tree Analysis

Reliability analysis of a hardware and software fault tolerant parallel processor

Numerical simulation to reliability analysis of fault-tolerant repairable system

Contact Info

Product

Resources

About