DocumentCode :
1353585
Title :
Modularizing and Minimizing Fault Trees
Author :
Wilson, J.M.
Author_Institution :
Loughborough University of Technology; Department of Management Studies; Loughborough Leics, LE11 3TU GREAT BRITAIN
Issue :
4
fYear :
1985
Firstpage :
320
Lastpage :
322
Abstract :
The analysis of a fault-tree by Locks showed that computation could be eased by modularizing the fault-tree. His process involves hand calculation and insight from the analyst. Many computer algorithms for minimizing a fault tree rely on a brute force method which leads to computational buildup. Approaches which simplify a tree by inspection and hand calculation can often be programed and form a useful tool for pre-analysis of a fault tree. This paper demonstrates that the process of modularizing can be organised by a simple computer program which can roughly analyse the fault tree prior to further analysis by a more sophisticated minimizing program. The methods allow some of the benefits of inspection to be incorporated into a computer program.
Keywords :
Boolean algebra; Fault trees; Inspection; Logic functions; Minimization methods; Packaging; Reliability; Boolean method; Fault-tree; Minimization; Module;
fLanguage :
English
Journal_Title :
Reliability, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9529
Type :
jour
DOI :
10.1109/TR.1985.5222175
Filename :
5222175
Link To Document :
بازگشت