期刊文献+

一个计算网络可靠度的递归算法 被引量:3

A Recursive Algorithm for Computing Network Reliability
下载PDF
导出
摘要 给出一个计算网络可靠度的有效算法,该算法的特点是结合概率论的有关知识和布尔代数运算:递归地调用一个简单、有效的概率公式来计算网络可靠度。该算法易于在计算机上操作和实现,从而适用于大型网络可靠度的定量计算。最后通过实例验证所给算法的有效性。 An efficient algorithm for computing network reliability is presented,The algorithm has the following characteristics:combine the relevant knowledge of probability theory and the Boolean algebra computation, it recursively calls a simple and effective probability formula to compute network reliability. The algorithm is easy to operate on a computer, so it applies to quantitative calculation of Large-scale network reliability. Finally, the efficiency of the proposed algorithm is illustrated by an example.
作者 牛义锋
出处 《计算技术与自动化》 2009年第4期80-82,98,共4页 Computing Technology and Automation
关键词 网络可靠度 不交和 极小路 network reliability sum of disjoint products minimal path
  • 相关文献

参考文献7

  • 1Institute of Electrical and Electronics Engineers, "IEEE Standard Computer Dietionary: A compilation of IEEE Standard Computer Glossaries,"New York, 1990.
  • 2FRATTA L, MONTANARI U G. A Boolean algebra method for computing the terminal reliability in a communication network [J]. IEEE Trans Circuit Theory, 1973, 20,203-211.
  • 3LOCKS M O. A minimizing algorithm for sum of disjoint products [J]. IEEE Trans Reliability, 1987; R-36:445-536.
  • 4LOCKS M O, Wil~n J M. Note on disjoint products algorithra[J]. IEEE Trans Reliability, 1992; R-41:81-84.
  • 5CHAT S R, SMITH A E. Estimation of all-terminal network reliabifity using an artificial neural network[J]. Computers & Operations Research, 2002,29:849- 868.
  • 6BRYANT R E. Symbolic Boolean manipulation with ordered binary -decision diagrams[J]. ACM Computing Surveys, 1992, 24(3) : 293-318.
  • 7孙艳蕊,陈永川,张祥德.一个计算无圈有向网络可靠度的新算法[J].通信学报,2002,23(12):1-7. 被引量:7

二级参考文献13

  • 1LOCKS M O, WISON J M. Note on disjoint products algorithm[J]. IEEE Trans Reliability, 1992, 41(1): 81-84.
  • 2HEIDTMANR D. Smaller sums of disjoint products by subproduct inversion[J].IEEE Trans Reliability, 1989, 38(3): 305-311.
  • 3COLBOURN C J. The Combinatorics of Network Reliability[M]. New York Oxford: Oxford University Press, 1987.
  • 4RAI S, KUMAR A. Recursive technique for computing system reliability[J]. IEEE Trans Reliability, 1987, 36(1): 38-44.
  • 5LOCKS M O. A minimizing algorithm for sum of disjoint products[J]. IEEE Trans Reliability, 1987, 36(4): 445-453.
  • 6VEERARAGHAVAN M, TRIVEDI K S. An improved algorithm for the symbolic reliability analysis of networks[J]. IEEE Trans Reliability, 1991, 40: 347-358.
  • 7SOH S, RAI S. Experimental results on preprocessing of path/cut terms in sum of disjoint products technique[J]. IEEE Trans Reliability, 1993,42(1): 24-33.
  • 8RAI S, VEERARAGHAVAN M, TRIVEDI K S. A survey of efficient reliability computation using disjoint products approach[J]. Networks, 1995, 25: 147-163.
  • 9LUO T, TRIVEDI K S. An improved algorithm for coherent-system reliability[J]. IEEE Trans Reliability, 1998, 47(1): 73-78.
  • 10WILSON J M. An improved minimizing algorithm for sum of disjoint products[J]. IEEE Trans Reliability, 1990, 39(1): 42-45.

共引文献6

同被引文献12

  • 1AHMAD S H.Simple enumeration of minimal cutsets of acyclic directed graph[J].IEEE Trans on Reliability,1988,27(5):484-487.
  • 2WILSON J M.An improved minimizing algorithm for sum of disjoint products[J].IEEE Trans on Reliability,1990,39(1):42-45.
  • 3RESENDE L.Implementation of a factoring algorithm for reliability evaluation of undirected networks[J].IEEE Trans on Reliability,1988,37(5):462-468.
  • 4WOOD P K.A factoring algorithm using polygon-chain reductions for computing K-terminal network reliability[J].Networks,1985,15:173-190.
  • 5SATYANARAYANA A,CHANG M K.Network reliability and the factoring theorem[J].Networks,1983,13:107-120.
  • 6HARDY G,LUCET C,LIMNIOS N.K-terminal network reliability measures with binary decision diagrams[J].IEEE Trans on Reliability,2007,56(3):506-515.
  • 7JANE C C,LAIH Y W.A practical algorithm for computing multi-state two-terminal reliability[J].IEEE Trans on Reliability,2008,57(2):295-302.
  • 8LOCKS M O.A minimizing algorithm for sum of disjoint products[J].IEEE Trans on Reliability,1987,36(4):436-445.
  • 9王英杰,陶世宁,程琳.交通网络连通可靠性评价方法研究[J].交通运输工程与信息学报,2008,6(2):102-106. 被引量:8
  • 10种鹏云,帅斌,尹惠,高洁.基于连通可靠性的危险品运输路径选择问题[J].中国安全科学学报,2014,24(5):92-97. 被引量:12

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部