Work

Comparison of variable ordering heuristics / algorithms for binary decision diagrams

Year: 1999
Type: other
Abstract: Fault tree analysis is a commonly used technique to assess the systems reliability \nperformance in terms of its components reliability characteristics. More recently, the \nBinary Decision Diagram (BDD) methodology has been introduced which significantly \naids the analysis of the fault tree diagram. The approach has been shown to improve \nboth the efficiency of determining the minimal cut sets of the fault tree, and also the \naccuracy of the calculation procedure used to quantify the top event parameters. \nTo utilise the technique the fault tree structure needs to be converted into the BDD \nformat. Converting the fault tree is relatively straightforward but requires the basic \nevents of the tree to be placed in an ordering. The ordering of the basic events is \ncritical to the resulting size of the BDD, and ultimately affects the performance and \nbenefits of this technique. \nNumerous studies have tackled this variable ordering problem and a number of \nheuristic approaches have been developed to produce an optimal ordering permutation \nfor a specific tree. These heuristic approaches do not always yield a minimal BDD \nstructure for all trees, some approaches generate orderings that are better for some trees \nbut worse for others. The most recent research to find an approach to produce an \noptimal ordering for a range of trees has looked at pattern recognition approaches, such \nas genetic algorithm based classifier systems. \nThis paper reviews the heuristic approaches that have been established and examines \nthe pattern recognition techniques that have been applied more recently. Another \npotential new algorithm for ordering using the structural importance of the components \nis proposed.
Language: English
Open Access status: green
OpenAlex ID: W586728132
Cites: 17
Cited by: 1
Related to: 10