Qualitative analysis of a BDMP by finite automata

Abstract : The Boolean Driven Markov Processes (BDMPs) were developed by EDF to conduct predictive risk modelling and assessment on critical systems. A BDMP model is a description of the combinations of failures that makes a system to fail like it is done with Fault tree models. The calculation of all the sequences of events that conduct to the global failure is complex as they are implicitly represented by a BDMP that generates a large state space. This paper provides a semantic analysis of BDMP models conducted within the languages and finite automaton theories in order to develop a systematic way to obtain an extensive representation of all scenarios contained in a BDMP. This representation is obtained by using an algorithm given in this paper which constructs an equivalent finite automaton of a BDMP. This FA representation leads to the possibility of extracting all the minimal scenarios of failure implicitly described by a BDMP.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

Contributor : Jean-Jacques Lesage <>
Submitted on : Wednesday, January 30, 2013 - 3:16:25 PM
Last modification on : Tuesday, March 6, 2018 - 3:58:03 PM
Long-term archiving on : Monday, June 17, 2013 - 5:37:45 PM


Files produced by the author(s)


  • HAL Id : hal-00782748, version 1



Pierre-Yves Chaux, Jean-Marc Roussel, Jean-Jacques Lesage, Gilles Deleuze, Marc Bouissou. Qualitative analysis of a BDMP by finite automata. 20th European Safety & Reliability Conf. (ESREL'11), Sep 2011, Troyes, France. pp. 2055-2057. ⟨hal-00782748⟩



Record views


Files downloads