A bottom-up algorithm for finding minimal cut-sets of fault trees

B. Clark, G. Reza-Latif-Shabgahi. A bottom-up algorithm for finding minimal cut-sets of fault trees. In M. H. Hamza, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February 17-19, 2004. pages 514-519, IASTED/ACTA Press, 2004.

Abstract

Abstract is missing.