2013
DOI: 10.1002/qre.1487
|View full text |Cite
|
Sign up to set email alerts
|

Quantitative Analysis of Dynamic Fault Trees Based on the Structure Function

Abstract: This paper presents a probabilistic model of dynamic gates which allows to perform the quantitative analysis of any dynamic fault tree (DFT) from its structure function. Both these probabilistic models and the quantitative analysis which can be performed thanks to them can accommodate any failure distribution of basic events. We illustrate our approach on a DFT example from the literature. Copyright © 2013 John Wiley & Sons, Ltd.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
44
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 53 publications
(44 citation statements)
references
References 24 publications
0
44
0
Order By: Relevance
“…However, when including dynamic asset dependencies, mathematical expressions become complicated for complex systems. See [64], [65] for the algebraic framework of non-repairable dynamic dependability.…”
Section: Relevant Workmentioning
confidence: 99%
See 1 more Smart Citation
“…However, when including dynamic asset dependencies, mathematical expressions become complicated for complex systems. See [64], [65] for the algebraic framework of non-repairable dynamic dependability.…”
Section: Relevant Workmentioning
confidence: 99%
“…Besides, the system failure condition which determines the final RUL varies from system to system. Sometimes it can be defined as a performance indicator of the system [66], [67], but there are situations in which timedependent failure occurrences of assets are needed to cause the system failure [64], [65] and this complicates the analytical treatment of the problem. In these situations, the applicability of analytic equations for system-level RUL is challenging.…”
Section: Relevant Workmentioning
confidence: 99%
“…This section is dedicated to a formalisation of DFTs by an algebraic description, as described in [12], [44], [13]. [20] Similar efforts can be found in [45], [20] and [46].…”
Section: F Algebraic Encodingmentioning
confidence: 99%
“…This is highly undesirable, since it can easily lead to different analysis results and wrong conclusions about the system's reliability-if an FTA tool interprets a model differently from its user, then one may conclude that the system meets its dependability requirements, whereas in reality it does not. [4] [5] [6], [7] [8] [9] [10], [11] [12], [13] Spare Awareness of these semantic issues is thus important to achieve faithful and reliable DFT modelling and analysis. This paper systematically uncovers the semantic differences and subtleties of DFT variants.…”
Section: Introductionmentioning
confidence: 99%
“…Yet these techniques become unfeasible when the independent sub-modules are placed under a dynamic gate. The IE-based approach [14,18] is a combinatorial method based on enumerating the complete minimal cut sequences/sets (MCSs) of a considered DFT. In contrast to Markov-based methods, the IE-based approach is efficient since it does not require highly-coupled DFTs converted to state space forms.…”
Section: Introductionmentioning
confidence: 99%