NEW ALGORITHMS FOR FAULT-TREES ANALYSIS

被引:327
作者
RAUZY, A
机构
[1] LaBRI, CNRS-Université Bordeaux I, 33405 Talence Cedex, 351, cours de la Libération
关键词
Failure analysis;
D O I
10.1016/0951-8320(93)90060-C
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a new method for fault tree management is presented. This method is based on binary decision diagrams and allows the efficient computation of both the minimal cuts of a fault tree and the probability of its root event. We show on a set of benchmarks that our method results in a qualitative and quantitative improvement in safety analysis of industrial systems.
引用
收藏
页码:203 / 211
页数:9
相关论文
共 7 条
[1]  
BILLON JC, 1988, IFIP WG102
[2]  
BRACE K, 1990, 27TH ACM IEEE DES AU
[3]  
BRYANT R, 1987, IEEE T COMPUT, V35, P677
[4]  
BURCH JR, 1990, P WORKSHOP DAC
[5]   EMBEDDING BOOLEAN EXPRESSIONS INTO LOGIC PROGRAMMING [J].
BUTTNER, W ;
SIMONIS, H .
JOURNAL OF SYMBOLIC COMPUTATION, 1987, 4 (02) :191-205
[6]  
COUDERT JC, 1991, BULL RT91028 RAPP RE
[7]  
LIMNIOS N, 1992, ARBRES DEFAILLANCES