论文信息 - A new analysis technique for probabilistic graphs

A new analysis technique for probabilistic graphs

A new technique for determining the terminal reliability of probabilistic networks is derived and discussed. The technique uses set-theoretic concepts to partition the space of all graph realizations in a way which permits extremely fast evaluation of the source-to-terminal probability. If not allowed to run to completion, the algorithm yields rapidly converging upper and lower bounds on that probability. Comparison with algorithms in the recent literature shows a decrease of one or two orders of magnitude in required CPU time.

J. O. Gobien | William P. Dotson | J. O. Gobien | W. Dotson

[1] Paul L. Meyer,et al. Introductory Probability and Statistical Applications , 1970 .

[2] U. Montanari,et al. A Boolean algebra method for computing the terminal reliability in a communication network , 1973 .

[3] E. Hansler. Comments on "A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network" , 1975 .

[4] A. C. Nelson,et al. A Computer Program for Approximating System Reliability , 1970 .

[5] P. M. Lin,et al. Some New Algorithms for Deterministic and Probabilistic Communication Networks. , 1974 .

[6] G. K. McAuliffe,et al. Exact calculation of computer network reliability , 1974, Networks.

[7] E. Hansler. A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network , 1972 .

[8] B. J. Leon,et al. A New Algorithm for Symbolic System Reliability Analysis , 1976, IEEE Transactions on Reliability.

[9] K.B. Misra,et al. A Fast Algorithm for Reliability Evaluation , 1975, IEEE Transactions on Reliability.

[10] David B. Brown,et al. A Computerized Algorithm for Determining the Reliability of Redundant Configurations , 1971 .

[11] K. B. Misra,et al. An Algorithm for the Reliability Evaluation of Redundant Networks , 1970 .

[12] O. Wing,et al. Analysis of Probabilistic Networks , 1964 .