Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/3711

Title: Comparison of two new approaches to variable ordering for binary decision diagrams
Authors: Bartlett, L.M.
Andrews, J.D.
Issue Date: 2000
Publisher: © The authors
Citation: BARTLETT, L.M. and ANDREWS, J.D., 2000. Comparison of two new approaches to variable ordering for binary decision diagrams. IN: Proceedings of the 14th ARTS, Advances in Reliability Technology Symposium, Manchester, 2000
Abstract: Fault tree analysis, FTA, is one of the most commonly used techniques for safety system analysis. There can be problems with the efficiency and accuracy of the approach when dealing with large tree structures. Recently the Binary Decision Diagram (BDD) methodology has been introduced which significantly aids the analysis of the fault tree diagram. The approach has been shown to improve both the efficiency of determining the minimal cut sets of the fault tree, and also the accuracy of the calculation procedure used to quantify the top event parameters. To utilise the BDD technique the fault tree structure needs to be converted into the BDD format. Converting the fault tree is relatively straightforward but 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. There are a number of variable ordering heuristics in the literature, however the performance of each depends on the tree structure being analysed. These heuristic approaches do not yield a minimal BDD structure for all trees, some approaches generate orderings that are better for some trees but worse for others. Within this paper two approaches to the variable ordering problem have been discussed. The first is the pattern recognition approach of neural networks, which is used to select the best ordering heuristic for a given fault tree from a set of alternatives. The second examines a completely new heuristic approach of using the structural importance of a component to produce a ranked ordering. The merits of each are discussed and the results compared.
Description: This is a conference paper
URI: https://dspace.lboro.ac.uk/2134/3711
Appears in Collections:Conference Papers and Presentations (Aeronautical and Automotive Engineering)

Files associated with this item:

File Description SizeFormat
00_ARTS_VarOrdComparison_LMB&JDA.pdfPaper127.19 kBAdobe PDFView/Open
00_ARTSp_VarOrdComparison_LMB&JDA.pdfSlides296.26 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.