METAPRIME - AN INTERACTIVE FAULT-TREE ANALYZER

被引:37
作者
COUDERT, O
MADRE, JC
机构
[1] DEC Paris Research Laboratory, Rueil Malmaison
关键词
(NON)COHERENT FAULT-TREE ANALYSIS; BINARY DECISION DIAGRAM; METAPRODUCT;
D O I
10.1109/24.285125
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The performances of almost all available fault-tree analysis tools are limited by the performance of their prime-implicant computation procedure. All these procedures manipulate the prime implicants of the fault-trees in extension, so that the analysis costs are directly related to the number of prime implicants to be generated, which in practice makes these tools difficult to apply on fault-trees with more than 20 000 prime implicants. This paper introduces an analysis method of coherent as well as noncoherent fault-trees that overcomes this limitation because its computational cost is related to neither the number of basic events, nor the number of gates, nor the number of prime implicants of these trees. We present the concepts underlying the prototype tool MetaPrime, and the experimental results obtained with this tool on real fault-trees. These results show that these concepts provide complete analysis in seconds on fault-trees that no previously available technique could ever even partially analyze, for instance noncoherent fault-trees with more than 10(20) prime implicants. These concepts can also be used to analyze event-trees because such trees denote Boolean functions on which these concepts can be applied. Prime implicant computation is also critical in many other domains, in particular in expert-system applications such as reasoning maintenance and multiple fault diagnosis. The application of the concepts underlying MetaPrime to the resolution of these problems is under study.
引用
收藏
页码:121 / 127
页数:7
相关论文
共 25 条
[1]  
AKERS SB, 1978, IEEE T COMPUT, V27, P509, DOI 10.1109/TC.1978.1675141
[2]  
[Anonymous], 1975, WASH1400
[3]  
BARTEE TC, 1962, THEORY DESIGN DIGITA
[4]  
BRACE KS, 1990, P 27 ACM IEEE DES AU, P40
[5]  
Brayton R.K., 1984, LOGIC MINIMIZATION A
[6]  
BRYANT RE, 1986, IEEE T COMPUT, V35, P677, DOI 10.1109/TC.1986.1676819
[7]  
COUDERT O, 1990, LECT NOTES COMPUT SC, V407, P365
[8]  
COUDERT O, 1992, ADVANCED RESEARCH IN VLSI AND PARALLEL SYSTEMS, P113
[9]  
COUDERT O, 1993, P A REL MAI, P2450
[10]  
COUDERT O, 1992, 29TH P IEEE DES AUT