Community Research and Development Information Service - CORDIS


This paper describes an efficient method for determining the significant minimal cut sets of complex fault trees. It is based on a top-down approach applied to a segmented fault tree obtained by means of the repeated identification of pseudo modules. The efficiency of this method is largely due to the use of binary decision diagrams as data structure. A prototype computer program was produced by modifying part of Ispra-FTA in order to prove the convenience of modifying existing software for fault tree analysis to produce more powerful tools. For non-monotonic functions an approximated solution is proposed that is acceptable in practical applications. The type of quantitative analysis than can be made is briefly shown in graphical form. Finally, the extraction from the graph of significant minimal cut sets by setting not uncertain thresholds is presented.

Additional information

Authors: CONTINI S, JRC Ispra (IT);DE COLA G, INFOCON, Lavagna (IT)
Bibliographic Reference: Article: European Journal of Diagnosis and Safety in Automation (1995)
Record Number: 199511315 / Last updated on: 1995-11-23
Original language: en
Available languages: en