๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improved accuracy in quantitative fault tree analysis

โœ Scribed by R. M. Sinnamon; J. D. Andrews


Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
121 KB
Volume
13
Category
Article
ISSN
0748-8017

No coin nor oath required. For personal study only.

โœฆ Synopsis


The fault tree diagram defines the causes of the system failure mode or 'top event' in terms of the component failures and human errors, represented by basic events. By providing information which enables the basic event probability to be calculated, the fault tree can then be quantified to yield reliability parameters for the system.

Fault tree quantification enables the probability of the top event to be calculated and in addition its failure rate and expected number of occurrences. Importance measures which signify the contribution each basic event makes to system failure can also be determined. Owing to the large number of failure combinations (minimal cut sets) which generally result from a fault tree study, it is not possible using conventional techniques to calculate these parameters exactly and approximations are required. The approximations usually rely on the basic events having a small likelihood of occurrence. When this condition is not met, it can result in large inaccuracies. These problems can be overcome by employing the binary decision diagram (BDD) approach. This method converts the fault tree diagram into a format which encodes Shannon's decomposition and allows the exact failure probability to be determined in a very efficient calculation procedure.

This paper describes how the BDD method can be employed in fault tree quantification.


๐Ÿ“œ SIMILAR VOLUMES


Improved efficiency in qualitative fault
โœ R. M. Sinnamon; J. D. Andrews ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 71 KB

The fault tree diagram itself is an excellent way of deriving the failure logic for a system and representing it in a form which is ideal for communication to managers, designers, operators, etc. Since the method was first conceived, algorithms to derive the minimal cut sets have worked directly wit