BDMP (Boolean logic driven Markov processes) as an alternative to event trees

In this paper, we will show on several examples that event trees can be replaced by BDMP, with the following advantages: suppression of ambiguities, better conciseness and readability, possibility to automatically (and efficiently) obtain the same minimal cutsets as with the event tree, and (if it is relevant) possibility to quantify the model with less conservatism by taking into account temporal dependences that are neglected by the cutset quantification approach.