MetaPrime: An Interactive Fault-Tree Analyzer

IEEE Transactions on Reliability

Volumn 43, Issue 1, 1994, Pages 121-127

  Coudert, Olivier ^a   Madre, Jean Christophe ^a  

^a DEC Paris Research Laboratory ^*  (France)

Author keywords

(Non)coherent fault tree analysis; Binary deci ; Metaproduct; sion diagram

Indexed keywords

APPROXIMATION THEORY; BINARY SEQUENCES; BOOLEAN FUNCTIONS; COMPUTATION THEORY; COSTS; EXPERT SYSTEMS; GRAPH THEORY; INTERACTIVE COMPUTER SYSTEMS; PROBABILITY; RELIABILITY;

EXPONENTIAL; INTENSION; INTERACTIVE FAULT TREE ANALYZER; METAPRIME; MULTIPLE FAULT DIAGNOSIS; NONCOHERENT FAULT TREE ANALYSIS; PRIME IMPLICANT COMPUTATION; REASONING MAINTENANCE; SETS OF ELEMENTS;

FAILURE ANALYSIS;

EID: 0028388503     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.285125     Document Type: Article

References (25)

1. S.B. Akers, “Binary decision diagrams”, IEEE Trans. Computers, vol C-27, num 6, 1978, pp 509–516.
2. T.C. Bartee, I.L. Lebow, I.S. Reed, Theory and Design of Digital Machines, 1962; McGraw-Hill.
3. K.S. Brace, R.L. Rudell, R.E. Bryant, “Efficient Implementation of a BDD package”, Proc. 27th IEEE Design Automation Conf, 1990 Jun, pp 40–45.
4. R.E. Brayton, G.D. Hachtel, C.T. McMullen, A.L. Sangiovanni-Vincentelli, Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, 1984; Kluwer Academic Publishers.
5. R.E. Bryant, “Graph-based algorithms for Boolean functions manipulation”, IEEE Trans. Computers, vol C-35, 1986 Aug, pp 677–692.
6. O. Coudert, C. Berthet, J.C. Madre, “Verification of synchronous se-quential machines based on symbolic execution”, Lecture Notes Computer Science: Automatic Verification Methods for Finite State Systems (J. Sifakis Ed.), vol 407, 1989 Jun, pp 365-373; Springer-Verlag.
7. O. Coudert, J.C. Madre, “A new method to compute prime and essen-tial prime implicants of Boolean functions”, Advanced Research in VLSI and Parallel Systems (Knight & Savage, Eds.), 1992 Mar, pp 113-128; The MIT Press.
8. O. Coudert, J.C. Madre, “Implicit and incremental computation of primes and essential primes of Boolean functions”, Proc. 29 th IEEE Design Automation Conf, 1992 Jun.
9. O. Coudert, J.C. Madre, “Fault-tree analysis: 10 20 Prime implicants and beyond”, Proc. Ann. Reliability & Maintainabilty Symp, 1993, pp 2450–245.
10. D.F. Hassl, “Advanced concepts in fault tree analysis”, Proc. System Safety Symp, 1965 Jun.
11. N. Ishiura, H. Sawada, S. Yajima, “Minimization of binary decision diagrams based on exchanges of variables”, Proc. IEEE Int'l Conf Com-puter Aided Design ‘91, 1991 Nov, pp 472–475.
12. S.-W. Jeong, B. Plessier, G.D. Hachtel, F. Somenzi, “Variable ordering for FSM traversal”, Proc. Int? Workshop on Logic Synthesis, 1991 May; Microelectronics Center of North Carolina.
13. T. Kohda, E.J. Henley, K. Inoue, “Finding modules in fault trees”, IEEE Trans. Reliability, vol 38, 1989 Jun, pp 165–176.
14. J.C. Madre, O. Coudert, “A logically complete reasoning maintenance system based on a logical constraint solver”, Proc. Int'l Joint Conf. Ar-tificial Intelligence ‘91, 1991 Aug, pp 294–299.
15. S. Malik, A.R. Wang, R.K. Brayton, A. Sangiovanni-Vincentelli, “Logic verification using binary decision diagrams in a logic synthesis environment”, Proc. IEEE Int'l Conf. Computer Aided Design ‘88, 1988 Nov, pp 6–9.
16. E.L. McCluskey Jr, “Minimization of Boolean functions”, Bell System Techniques, vol 35, 1959, pp 1417–1444.
17. F.A. Patterson-Hine, B.V. Koen, “Direct evaluation of fault trees using object oriented programming techniques”, IEEE Trans. Reliability, vol 38, 1989 Jun, pp 186–192.
18. W.V.O. Quine, “The problem of simplifying truth functions”, Amer. Mathematics Monthly, vol 59, 1952, pp 521–531.
19. W.V.O. Quine, “On cores and prime implicants of truth functions”, Amer. Mathematics Monthly, vol 66, 1959.
20. Reactor Safety Study. “An assessment of accident risks in US commer-cial nuclear power plants”, WASH 1400 (NUREG 74/014), 1975 Oct; US NRC.
21. R. Reiter, J. de Kleer, “Foundation of assumption-based truth maintenance systems: Preliminary report”, Proc. 6th AAAI, 1987, pp 183–188.
22. W.G. Schneeweiss, “Disjoint Boolean products via Shannon expansion”, IEEE Trans. Reliability, vol R-33, 1984, pp 329–332.
23. W.G. Schneeweiss, “Fault-tree analysis using a binary decision tree”, IEEE Trans. Reliability, vol R-34, 1985, pp 353–357.
24. J.R. Slage, C.L. Chang, R.C.T. Lee, “A new algorithm for generating prime implicants”, IEEE Trans. Computers, vol C-19, num 4, 1970, pp 304–310.
25. P. Tison, “Generalized consensus theory and application to the minimization of Boolean functions”, IEEE Trans. Electronic Computers, vol EC-16, num 4, 1967, pp 446–456.