Systematic extraction of Minimal Cut Sequences from a BDMP model

Pierre-Yves Chaux (1) , Jean-Marc Roussel (1) , Jean-Jacques Lesage (1) , Gilles Deleuze (2) , Marc Bouissou (2)

1 LURPA - Laboratoire Universitaire de Recherche en Production Automatisée
2 EDF R&D - EDF R&D

The Boolean logic Driven Markov Processes (BDMPs) have been developed by EDF to conduct predictive risk modeling and assessment for critical systems. A BDMP is a dynamic model based on fault trees dedicated to repairable systems. The qualitative reliability analyses performed on this kind of model consist in computing the minimal scenarios that lead to the system failure which are known as Minimal Cut Sequences (MCS). This paper defines the concept of Minimal Cut sequences for BDMPs and gives a way to compute them using an equivalent finite automaton developed in our previous works.

Mots clés: BDMP; Dynamic Fault Tree; Minimal Cut Sequence; Repairable System; Finite Automata

Domaines: Automatique / Robotique

Pierre-Yves Chaux, Jean-Marc Roussel, Jean-Jacques Lesage, Gilles Deleuze, Marc Bouissou. Systematic extraction of Minimal Cut Sequences from a BDMP model. 21th European Safety & Reliability Conf. (ESREL'12), Jun 2012, Helsinki, Finland. paper 16B-We4-3, 8 p. ⟨hal-00782735⟩