An Efficient Computational Technique for Evaluating the Cut/Tie Sets and Common-Cause Failures of Complex Systems
暂无分享,去创建一个
[1] G. K. McAuliffe,et al. Exact calculation of computer network reliability , 1899 .
[2] Arnie Rosenthal. Approaches to Comparing Cut-Set Enumeration Algorithms , 1979, IEEE Transactions on Reliability.
[3] R. Billinton,et al. An Efficient Algorithm for Deducing the Minimal Cuts and Reliability Indices of a General Network Configuration , 1976, IEEE Transactions on Reliability.
[4] Paul A. Jensen,et al. An Algorithm to Determine the Reliability of a Complex System , 1969 .
[5] P. Mussio,et al. Efficient Construction of Minimal Cut Sets from Fault Trees , 1977, IEEE Transactions on Reliability.
[6] A. C. Nelson,et al. A Computer Program for Approximating System Reliability , 1970 .
[7] G. K. McAuliffe,et al. Exact calculation of computer network reliability , 1974, Networks.
[8] E. Hansler. A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network , 1972 .
[9] D. Rasmuson,et al. FATRAM-A Core Efficient Cut-Set Algorithm , 1978, IEEE Transactions on Reliability.
[10] W. E. Vesely,et al. NEW METHODOLOGY FOR OBTAINING CUT SETS FOR FAULT TREES. , 1972 .