02-05.pdf (300.26 kB)
A fault tree analysis strategy using binary decision diagrams
preprint
posted on 2005-08-23, 09:33 authored by Karen A. Reay, J.D. AndrewsThe use of Binary Decision Diagrams (BDDs) in fault tree analysis provides both an accurate
and efficient means of analysing a system. There is a problem however, with the conversion
process of the fault tree to the BDD. The variable ordering scheme chosen for the
construction of the BDD has a crucial effect on its resulting size and previous research has
failed to identify any scheme that is capable of producing BDDs for all fault trees. This paper
proposes an analysis strategy aimed at increasing the likelihood of obtaining a BDD for any
given fault tree, by ensuring the associated calculations are as efficient as possible. The
method implements simplification techniques, which are applied to the fault tree to obtain a
set of 'minimal' subtrees, equivalent to the original fault tree structure. BDDs are constructed
for each, using ordering schemes most suited to their particular characteristics. Quantitative
analysis is performed simultaneously on the set of BDDs to obtain the top event probability,
the system unconditional failure intensity and the criticality of the basic events.
History
School
- Science
Department
- Mathematical Sciences
Pages
307464 bytesPublication date
2002Notes
This pre-print has been submitted, and accepted, to the journal, Reliability Engineering and System Safety [© Elsevier]. The definitive version: REAY, K.A. and ANDREWS, J.D., 2002. A Fault tree analysis strategy using binary decision diagrams. Reliability Engineering and System Safety, 78(1), pp.45-56, is available at: http://www.sciencedirect.com/science/journal/09518320.Language
- en