Dynamic fault trees resolution: A conscious trade-off between analytical and simulative approaches

Chiacchio, Francesco; Compagno, Lucio; D’Urso, Diego; Manno, Gabriele; Trapani, Natalia

doi:10.1016/j.ress.2011.06.014

Cited by 47 publications

(20 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Monte Carlo is a simulation method used to solve DFTs for complex systems with any time to failure distribution of components . The main problem for the simulation‐based techniques is the need of a long computation time to get accurate results especially in the case of rare events . Cheshmikhani and Zarandi used stochastic logic gates for converting each static and dynamic output gates of DFT in order to accelerate computation of the Monte Carlo‐based methods using the time to failure tree presented in .…”

Section: Introductionmentioning

confidence: 99%

Probability and Frequency Derivation Using Dynamic Fault Trees

Hamaidia

Kara

Innal

2018

Process Safety Progress

View full text Add to dashboard Cite

Dynamic Fault Tree (DFT) is suitable to capture functional and dynamic dependencies among events leading to system failure. There exist several approaches for analyzing DFTs, each of them suffers from drawbacks that limit its practical use. This paper presents a comprehensive methodology based on the structure function determination. It consists in performing both qualitative and quantitative analysis to establish failure sequences and to calculate the likelihood (probability and frequency) of dynamic systems failure. Failure sequences are extracted from the minimal canonical form of the top event and allow getting disjunctive failure sequences. From the quantitative point of view, the probability and frequency of any DFT top event are developed to make the proposed model able to quantify the failure probability and frequency of dynamic systems and the frequency of accident scenarios. The proposed procedure is applied on two benchmark examples: the first one is a safety‐related system while the second one is an accident scenario with dependent protection layers. In order to check the validity of the proposed method, the derived numerical results are compared with those obtained from Markov Chains models. © 2018 American Institute of Chemical Engineers Process Saf Prog 37: 535–552, 2018

show abstract

Section: Introductionmentioning

confidence: 99%

Probability and Frequency Derivation Using Dynamic Fault Trees

Hamaidia

Kara

Innal

2018

Process Safety Progress

View full text Add to dashboard Cite

show abstract

“…lumping Markov chains [9][10], and compositional methods [11][12]. Such methodologies can heavily reduce the state space scale of a system to be studied under certain circumstances.…”

Section: Introductionmentioning

confidence: 99%

Quantitative analysis of dynamic fault trees using improved Sequential Binary Decision Diagrams

Meng

Yang

et al. 2015

Reliability Engineering & System Safety

View full text Add to dashboard Cite

“…However, combinatorial growth of Markov chain states is still the main problem of the method based on Markov chain representation of DFT. Several simplifications were suggested in case of DFT without reparable components . However, most of them are not valid for reparable DFT, and the complexity of the problem is increasing dramatically with the increase of the number of system components.…”

Section: Introductionmentioning

confidence: 99%

“…Several simplifications were suggested in case of DFT without reparable components. [11][12][13][14][15] However, most of them are not valid for reparable DFT, and the complexity of the problem is increasing dramatically with the increase of the number of system components. Current methods are very limited by DFT size in particular by number of BEs.…”

mentioning

confidence: 99%

An Efficient Approximate Markov Chain Method in Dynamic Fault Tree Analysis

Yevkin

2015

Qual. Reliab. Engng. Int.

View full text Add to dashboard Cite

Approximate Markov chain method for dynamic fault tree analysis is suggested for both reparable and non‐reparable systems. The approximation is based on truncation, aggregation and elimination of Markov chain states during the process of dynamic fault tree transformation to corresponding Markov chain. The method is valid for small probabilities. For reparable systems, it is true if mean time to repair is much less than mean time to failure. Several examples are studied. Additional simplification is considered in case the system is in a steady state. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Dynamic fault trees resolution: A conscious trade-off between analytical and simulative approaches

Cited by 47 publications

References 21 publications

Probability and Frequency Derivation Using Dynamic Fault Trees

Probability and Frequency Derivation Using Dynamic Fault Trees

Quantitative analysis of dynamic fault trees using improved Sequential Binary Decision Diagrams

An Efficient Approximate Markov Chain Method in Dynamic Fault Tree Analysis

Contact Info

Product

Resources

About