+44 (0)1509 263171
Please use this identifier to cite or link to this item:
|Title: ||Qualitative analysis of complex, modularised fault trees using binary decision diagrams.|
|Authors: ||Remenyte, Rasa|
|Issue Date: ||2005|
|Publisher: ||© Loughborough University|
|Citation: ||REMENYTE, R. and ANDREWS, J.D., 2005. Qualitative analysis of complex, modularised fault trees using binary decision diagrams. IN: Proceedings of the 16th ARTS (Advances in Reliability Technology Symposium), Loughborough University, UK, April 2005 pp. 379-394.|
|Abstract: ||Fault Tree Analysis is commonly used in the reliability assessment of industrial
systems. However, when complex systems are studied conventional methods can
become computationally intensive and require the use of approximations. This leads
to inaccuracies in evaluating system reliability. To overcome such disadvantages, the
Binary Decision Diagram (BDD) method has been developed. This method improves
accuracy and efficiency, because the exact solutions can be calculated without the
requirement to calculate minimal cut sets as an intermediate phase. Minimal cut sets
can be obtained if needed.
BDDs are already proving to be of considerable use in system reliability analysis.
However, the difficulty is with the conversion process of the fault tree to the BDD.
The ordering of the basic events can have a crucial effect on the size of the final
BDD, and previous research has failed to identify an optimum scheme for producing
BDDs for all fault trees. This paper presents an extended strategy for the analysis of
complex fault trees. The method utilises simplification rules, which are applied to the
fault tree to reduce it to a series of smaller subtrees, whose solution is equivalent to
the original fault tree. The smaller subtree units are less sensitive to the basic event
ordering during BDD conversion. BDDs are constructed for every subtree. Qualitative
analysis is performed on the set of BDDs to obtain the minimal cut sets for the
original top event. It is shown how to extract the minimal cut sets from complex and
modular events in order to obtain the minimal cut sets of the original fault tree in
terms of basic events.|
|Description: ||This is a conference paper.|
|Appears in Collections:||Conference Papers and Contributions (Aeronautical and Automotive Engineering)|
Files associated with this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.