Choosing a heuristic for the "fault tree to binary decision diagram" conversion, using neural networks

Fault-tree analysis is commonly used for risk assessment of industrial systems. Several computer packages are available to carry out the analysis. Despite its common usage there are associated limitations of the technique 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 BDD (binary decision diagram). To use the BDD, the fault-tree structure needs to be converted into the BDD format. Converting the fault tree is relatively straightforward but requires that the basic events of the tree be ordered. This ordering is critical to the resulting size of the BDD, and ultimately affects the qualitative and quantitative performance and benefits of this technique. Several heuristic approaches were 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. There is no single heuristic that guarantees a minimal BDD for any fault-tree structure. This paper looks at a selection approach using a neural network to choose the best heuristic from a set of alternatives that will yield the smallest BDD and promote an efficient analysis. The set of possible selection choices are 6 alternative heuristics, and the prediction capacity produced was a 70% chance of the neural network choosing the best ordering heuristic from the set of 6 for the test set of given fault trees.

[1]  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..

[2]  Saburo Muroga,et al.  Binary Decision Diagrams , 2000, The VLSI Handbook.

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

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

[5]  Christopher M. Bishop,et al.  Neural networks for pattern recognition , 1995 .

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

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

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

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

[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]  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.

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

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

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