Research Article
Non deterministic Repairable Fault Trees for computing optimal repair strategy
@INPROCEEDINGS{10.4108/ICST.VALUETOOLS2008.4411, author={Marco Beccuti and Daniele Codetta-Raiteri and Giuliana Franceschinis and Serge Haddad}, title={Non deterministic Repairable Fault Trees for computing optimal repair strategy}, proceedings={3rd International ICST Conference on Performance Evaluation Methodologies and Tools}, publisher={ICST}, proceedings_a={VALUETOOLS}, year={2010}, month={5}, keywords={Fault Tree Optimal repair strategy Markov Decision Pro- cess Markov Decision Petri Net}, doi={10.4108/ICST.VALUETOOLS2008.4411} }- Marco Beccuti
Daniele Codetta-Raiteri
Giuliana Franceschinis
Serge Haddad
Year: 2010
Non deterministic Repairable Fault Trees for computing optimal repair strategy
VALUETOOLS
ICST
DOI: 10.4108/ICST.VALUETOOLS2008.4411
Abstract
In this paper, the Non deterministic Repairable Fault Tree (NdRFT) formalism is proposed: it allows to model failure modes of complex systems as well as their repair processes. The originality of this formalism with respect to other Fault Tree extensions is that it allows to face repair strategies optimization problems: in an NdRFT model, the decision on 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 to specify which failure events are observable, whether local repair or global repair can be applied, and the resources needed to start a repair action. The optimal repair strategy can then be computed by solving an optimization problem on a Markov Decision Process (MDP) derived from the NdRFT. A software framework is proposed in order to perform in automatic way the derivation of an MDP from a NdRFT model, and to deal with the solution of the MDP.
