Dynamic labelling of BDD and ZBDD for efficient non-coherent fault tree analysis

V. Matuzas and S. Contini

Reliability Engineering and System Safety, 2015, vol. 144, issue C, 183-192

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).

Keywords: Fault tree analysis; Binary Decision Diagrams; Cut-off techniques; Truncation error; Truncated BDD/ZBDD (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0951832015002021
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:144:y:2015:i:c:p:183-192

DOI: 10.1016/j.ress.2015.07.012

Access Statistics for this article

Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares

More articles in Reliability Engineering and System Safety from Elsevier
Bibliographic data for series maintained by Catherine Liu ().