Finding the minimal cut sequences of dynamic, repairable, and reconfigurable systems from Generalized Boolean logic Driven Markov Process models

International audienceMinimal cut sequences computation is the main objective of qualitative safety analysis of dynamic systems. This article shows first that the existing definitions of minimal cut sequences are not suitable when these systems are both repairable and reconfigurable. A new definition for this class of systems as well as an algorithm to compute these sequences from a safety analysis model, in the form of a Generalized Boolean logic Driven Markov Processes model, are then proposed. These contributions are illustrated on a case study from power industry. Comparison of the obtained minimal cut sequences to those which are yielded by algorithms based on the previous definitions permits to highlight the relevance of the approach