Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia

Reliability Engineering and System Safety

Volumn 58, Issue 2, 1997, Pages 127-144

  Rauzy, Antoine ^a   Dutuit, Yves ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BOOLEAN FUNCTIONS; COMPUTATION THEORY; DATA STRUCTURES; DECISION THEORY; FAILURE ANALYSIS; PROBABILITY; RELIABILITY; SAFETY FACTOR;

BINARY DECISION DIAGRAM; FAULT TREE METHOD;

ALGORITHMS;

EID: 0031276402     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0951-8320(97)00034-3     Document Type: Article

References (17)

1. Akers, B., Binary decision diagrams. IEE Transactions on Computers, 1978, 276, 509-516.
2. er congrès interdisciplinaire sur la Qualité et la Sûreté de Fonctionnnement. Université Technologique de Compiègne, France, 1994, pp. 47-56.
3. Groupe Aralia, Computation of prime implicants of a fault tree within Aralia. In Proceedings of the European Safety and Reliability Association Conference, ESREL'95, Bournemouth, England, European Safety and Reliability Association, June 1995, pp.190-202.
4. Brace, K., Rudell, R. and Bryant, R., Efficient implementation of a BDD package. In Proceedings of the 21th ACM/IEEE Design Automation Conference, IEEE 0738, 1990.
5. Bryant, R., Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, 1986, 358, 677-691.
6. Bryant, R., Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 1992.
7. Chandra, A. K. and Markowsky, G., On the number of prime implicants. Discrete Mathematics, 1978, 24, 7-11.
8. Coudert, O. and Madre, J.-C., A new method to compute prime and essential prime implicants of boolean functions. In Advanced Research in VLSI and Parallel Systems, eds Knight, T. and Savage, J., 1992, pp.113-128.
9. th ACM/IEEE Design Automation Conference, DAC'92, June 1992.
10. Camarinopoulos, L. and Yllera, J., An improved top-down algorithm combined with modularization as highly efficient method for fault tree analysis. Reliability Engineering and System Safety, 1985, 11, 93-108.
11. Lee, W. S., Grosh, D. L., Tillman, F. A. and Lie, C. H., Fault tree analysis, methods and applications: a review. IEEE Transactions on Reliability, 1985, 34, 194-303.
12. Minato, S., Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proceedings of the 30th ACM/IEEE Design Automation Conference, DAC'93, 1993, pp.272-277.
13. Quine, W. V. Q., The problem of simplifying truth functions. American Mathematics Monthly, 1952, 59, 521-531.
14. Quine, W. V. O., On cores and prime implicants of truth functions. American Mathematics Monthly, 1959, 66, 755-760.
15. Rauzy, A., New algorithms for fault trees analysis. Reliability Engineering & System Safety, 1993, 503, 203-211.
16. Rauzy, A., An introduction to binary decision diagrams and some of their applications to risk assessment. In Actes de l'école d'été, Modélisation et Vérification de Processus Parallèles, MOVEP'96, éd. Roux, O., 1996.
17. Vesely, W. E., Goldberg, F. F., Robert, N. H. and Haas, D. F., Fault Tree Handbook. Technical Report NUREG 0492, US Nuclear Regulatory Commission, 1981.