Reduced ZBDD Construction Algorithms for Large Fault Trees Analysis

The determination of the small set of Significant Minimal Cut Sets (SMCS) is currently the unique mode for analysing complex trees. The set of SMCS is made up by failure combinations having probability greater than and / or order less than pre-established probabilistic and logical thresholds. Rules for constructing a Reduced ZBDD (RZBDD) embedding all SMCS satisfying the cut-off conditions was proposed by Jung et al. for coherent fault trees. This paper describes an improved implementation of the Jung method and a new set of rules for the construction of an RZBDD for non-coherent fault trees. The proposed method is based on a Labelled BDD (LBDD) in which the information about the variable type is dynamically associated to the nodes. Test results of the application of the RZBDD algorithms implemented in the JRC ASTRA fault tree analyser will be provided to show the efficiency of the proposed methods.

CONTINI Sergio;  MATUZAS Vaidas; 

2010-09-15

Taylor & Francis Group

JRC57858

https://publications.jrc.ec.europa.eu/repository/handle/JRC57858,