Bridging the gap between systems and dynamic fault tree models

Manian, R.; Coppit, David; Sullivan, Kevin; Dugan, J.B.

doi:10.1109/rams.1999.744104

Cited by 44 publications

(24 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The NdRFT formalism could be also extended by considering dynamic gates [2], which allow us to express functional and temporal dependencies among component failures, as well as preemption of repair resources. A particular dynamic gate allows us to model the presence of spare components able to replace the main ones if failed.…”

Section: Discussionmentioning

confidence: 99%

“…In this example the cost of repair actions is not taken into account, while the next example instead takes also the repair cost into account: (2) where down penalty is the cost of having system down per time unit, rep cost per time unit(e) is the cost per time unit of a repair associated with event e, and start repair cost(e) is a fixed cost paid every time a repair process associated with event e starts. In the example a repair cost could be defined for the repair actions of events A1, P1, A2, P2, and U2: the cost can be an instantaneous start repair cost or a cost that accumulates during the whole repair process (or both).…”

Section: Ndrft Syntaxmentioning

confidence: 99%

“…Dynamic FT [2], Parametric FT [3], etc.). One of these extension, the Repairable FT (RFT) [4], was presented to evaluate the effect of different repair policies on a repairable system.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis

Beccuti¹,

Franceschinis²,

Codetta‐Raiteri³

et al. 2013

The Computer Journal

View full text Add to dashboard Cite

In this paper, the Non deterministic Repairable Fault Tree (NdRFT) formalism is proposed: it allows the modeling of failures of complex systems in addition to their repair processes. Its originality with respect to other Fault Tree extensions allows us to address repair strategy optimization problems: in an NdRFT model, the decision as to whether to start or not a given repair action is non deterministic, so that all the possibilities are left open. The formalism is rather powerful allowing the specification of self revealing events, components degradation, whether local repair, global repair and preventive maintenance can be applied, and the resources needed to start a repair action. The optimal repair strategy with respect to some relevant system state function, e.g. system unavailability, can then be computed by solving an optimization problem on a Markov Decision Process derived from the NdRFT. Such derivation is obtained by converting the NdRFT model into an intermediate formalism called Markov Decision Petri Net (MDPN). In the paper, the NdRFT syntax and semantics are formally described, together with the conversion rules into MDPN. The application of NdRFT is illustrated through examples.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Ndrft Syntaxmentioning

confidence: 99%

See 1 more Smart Citation

Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis

Beccuti¹,

Franceschinis²,

Codetta‐Raiteri³

et al. 2013

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…corresponding to a system with degraded performance): this requires to extend the formalism to specify the function to be optimized, and the translation to derive the corresponding MDP reward function. Another possible extension of ParNdRFT could be to consider dynamic gates [11], which allow to express functional and temporal dependencies among component failures, as well as repair resources preemption.…”

Section: Discussionmentioning

confidence: 99%

Parametric NdRFT for the derivation of optimal repair strategies

Beccuti

Franceschinis

Haddad

2009

2009 IEEE/IFIP International Conference on Dependable Systems &Amp; Networks

View full text Add to dashboard Cite

show abstract

“…Note that no notion of causality is included. Tool support for FTAs in Galileo is presented in [33]; underlying algorithms are described in [34].…”

Section: A Fault Tree Automaton Constructionmentioning

confidence: 99%

Uncovering Dynamic Fault Trees

Junges

Guck

Katoen

et al. 2016

2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)

View full text Add to dashboard Cite

Abstract-Fault tree analysis is a widespread industry standard for assessing system reliability. Standard (static) fault trees model the failure behaviour of systems in dependence of their component failures. To overcome their limited expressive power, common dependability patterns, such as spare management, functional dependencies, and sequencing are considered. A plethora of such dynamic fault trees (DFTs) have been defined in the literature. They differ in e.g., the types of gates (elements), their meaning, expressive power, the way in which failures propagate, how elements are claimed and activated, and how spare races are resolved. This paper systematically uncovers these differences and categorises existing DFT variants. As these differences may have huge impact on the reliability assessment, awareness of these impacts is important when using DFT modelling and analysis.

show abstract

Bridging the gap between systems and dynamic fault tree models

Cited by 44 publications

References 7 publications

Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis

Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis

Parametric NdRFT for the derivation of optimal repair strategies

Uncovering Dynamic Fault Trees

Contact Info

Product

Resources

About