Efficient Ordering Heuristics in Binary Decision Diagram-based Fault Tree Analysis

QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, pp. 307-315, 2013.

Cited by: 7|Views6
EI WOS SCOPUS

Abstract:

In binary decision diagrambased fault tree analysis, the size of binary decision diagram encoding fault trees heavily depends on the chosen ordering. Heuristics are often used to obtain good orderings. The most important heuristics are depth-first leftmost (DFLM) and its variants weighting DFLM (WDFLM) and repeated-event-priority DFLM (RD...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments