An ordering heuristic to develop the binary decision diagram based on structural importance

Abstract Fault tree analysis is often used to assess risks within industrial systems. The technique is commonly used although there are associated limitations in terms of accuracy and efficiency when dealing with large fault tree structures. The most recent approach to aid the analysis of the fault tree diagram is the Binary Decision Diagram (BDD) methodology. To utilise the technique the fault tree structure needs to be converted into the BDD format. Converting the fault tree requires the basic events of the tree to be placed in an ordering. The ordering of the basic events is critical to the resulting size of the BDD, and ultimately affects the performance and benefits of this technique. A number of heuristic approaches have been developed to produce an optimal ordering permutation for a specific tree. These heuristic approaches do not always yield a minimal BDD structure for all trees. This paper looks at a heuristic that is based on the structural importance measure of each basic event. Comparing the resulting size of the BDD with the smallest generated from a set of six alternative ordering heuristics, this new structural heuristic produced a BDD of smaller or equal dimension on 77% of trials.

[1]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2]  John Andrews,et al.  Efficient basic event orderings for binary decision diagrams , 1998, Annual Reliability and Maintainability Symposium. 1998 Proceedings. International Symposium on Product Quality and Integrity.

[3]  W. E. Vesely,et al.  A time-dependent methodology for fault tree evaluation , 1970 .

[4]  Roslyn M. Sinnamon,et al.  Improved efficiency in qualitative fault tree analysis , 1997 .

[5]  Antoine Rauzy,et al.  A brief introduction to Binary Decision Diagrams , 1996 .

[6]  Marc Bouissou.  An ordering heuristic for building binary decision diagrams from fault-trees , 1996, Proceedings of 1996 Annual Reliability and Maintainability Symposium.

[7]  Roslyn M. Sinnamon,et al.  Fault tree analysis and binary decision diagrams , 1996, Proceedings of 1996 Annual Reliability and Maintainability Symposium.

[8]  Antoine Rauzy,et al.  New algorithms for fault trees analysis , 1993 .

[9]  藤田 昌宏,et al.  Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams , 1988 .

[10]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[11]  A. Rauzy,et al.  BDD BASED FAULT-TREE PROCESSING : A COMPARISON OF VARIABLE ORDERING HEURISTICS , .

[12]  Antoine Rauzy,et al.  BDD Based Fault-Tree Processing , 1997 .

[13]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[14]  Masahiro Fujita,et al.  On variable ordering of binary decision diagrams for the application of multi-level logic synthesis , 1991, Proceedings of the European Conference on Design Automation..

[15]  John Andrews,et al.  Quantitative fault tree analysis using Binary Decision Diagrams , 1996 .