Improving the analysis of dependable systems by mapping fault trees into Bayesian networks

被引:770
作者
Bobbio, A
Portinale, L
Minichino, M
Ciancamerla, E
机构
[1] ENEA, CRE Casaccia, I-00060 Rome, Italy
[2] Univ Piemonte Orientale, Dipartimento Sci & Tecnol Avanzate, I-15100 Alessandria, Italy
关键词
dependable systems; probabilistic methods; Bayesian networks; fault tree analysis;
D O I
10.1016/S0951-8320(00)00077-6
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Bayesian Networks (BN) provide a robust probabilistic method of reasoning under uncertainty. They have been successfully applied in a variety of real-world tasks but they have received little attention in the area of dependability. The present paper is aimed at exploring the capabilities of the BN formalism in the analysis of dependable systems. To this end, the paper compares BN with one of the most popular techniques for dependability analysis of large, safety critical systems, namely Fault Trees (FT). The paper shows that any FT can be directly mapped into a BN and that basic inference techniques on the latter may be used to obtain classical parameters computed from the former (i.e. reliability of the Top Event or of any sub-system, criticality of components, etc). Moreover, by using BN, some additional power can be obtained, both at the modeling and at the analysis level. At the modeling level, several restrictive assumptions implicit in the FT methodology can be removed and various kinds of dependencies among components can be accommodated. At the analysis level, a general diagnostic analysis can be performed. The comparison of the two methodologies is carried out by means of a running example, taken from the literature, that consists of a redundant multiprocessor system. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:249 / 260
页数:12
相关论文
共 24 条
[1]  
ALMOND G, 1992, EXTENDED EXAMPLE TES
[2]  
ANDERSON SK, 1989, WOOD AP AI DETR MI, P1080
[3]  
[Anonymous], 1989, PROBABILISTIC REASON
[4]  
BOBBIO A, 1999, P 18 INT C COMP SAF, V1698, P310
[5]   THE COMPUTATIONAL-COMPLEXITY OF PROBABILISTIC INFERENCE USING BAYESIAN BELIEF NETWORKS [J].
COOPER, GF .
ARTIFICIAL INTELLIGENCE, 1990, 42 (2-3) :393-405
[6]  
DELIC KA, 1995, FORMALISING ENG JUDG
[7]  
DOYLE SA, 1985, IEEE T RELIAB, V34, P236
[8]   COVERAGE MODELING FOR DEPENDABILITY ANALYSIS OF FAULT-TOLERANT SYSTEMS [J].
DUGAN, JB ;
TRIVEDI, KS .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (06) :775-787
[9]  
Fenton N., 1998, IEE Proceedings-Software, V145, P35, DOI 10.1049/ip-sen:19984895
[10]   MULTIPLE-VALUED LOGIC TREES - MEANING AND PRIME IMPLICANTS [J].
GARRIBBA, S ;
GUAGNINI, E ;
MUSSIO, P .
IEEE TRANSACTIONS ON RELIABILITY, 1985, 34 (05) :463-472