a Département d’Informatique et Optimisation, Institut National des Postes et Telecommunications, Campus Universitaire, Souissi, Rabat, Morocco;b Département Génie Mécanique, EMI, Morocco;c Département Génie Industriel, EMI, Morocco
Abstract:
This article presents a new algorithm that we have developed to find the minimal cut-sets of a coherent fault tree. The model presented is based on Petri nets. We also show that for a large fault tree, we are faced with the complexity problem. We suggest the use of place fusion as well as a methodology that can allow us to overcome this difficulty.