Title: Dynamic labelling of BDD and ZBDD for efficient non-coherent fault tree analysis
Authors: MATUZAS VAIDASContini Sergio
Citation: RELIABILITY ENGINEERING & SYSTEM SAFETY vol. 144 p. 183-192
Publisher: ELSEVIER SCI LTD
Publication Year: 2015
JRC N°: JRC89446
ISSN: 0951-8320
URI: http://www.sciencedirect.com/science/article/pii/S0951832015002021
http://publications.jrc.ec.europa.eu/repository/handle/JRC89446
DOI: 10.1016/j.ress.2015.07.012
Type: Articles in periodicals and books
Abstract: Binary Decision Diagram (BDD) based fault tree analysis algorithms are among the most efficient ones. They allow performing exact probabilistic analyses, as well as to derive a Zero-suppressed BDD (ZBDD) to efficiently encode Significant Prime Implicants (PI) or Minimal Cut Sets (MCS). The present paper describes a dynamic labelling method for BDD/ZBDD to analyse non-coherent fault trees. An L-BDD is a BDD in which the information about the variable type is associated to each node. This information is useful to select, for each node, the corresponding algorithms for performing the probabilistic analysis and for determining PI or MCS. When the computational resources are not sufficient to complete the BDD construction, it is convenient to construct the ZBDD directly from the fault tree. The second part of this paper describes rules for constructing a Truncated Labelled ZBDD (TL-ZBDD) of non-coherent fault trees. Results of the analysis of some non-coherent fault trees by means of L-BDD and TL-ZBDD are provided.
JRC Directorate:Energy, Transport and Climate

Files in This Item:
There are no files associated with this item.


Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.