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

researchr

You are not signed in
Sign in
Sign up

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.

This author has not been identified. Look up 'B. Clark' in GoogleThis author has not been identified. Look up 'G. Reza-Latif-Shabgahi' in Google

runs on WebDSL