利用二分决策图计算网络可靠度的一个有效算法

Efficient Algorithm of Computing Networks Reliability by Using Binary Decision Diagrams

利用二分决策图，同时采用道路排序技巧及布尔代数运算给出了求不交和的方法，它比单纯采用二分决策图的算法更简单，不交和的项数更少，从而得到一个求网络可靠度的有效算法．

Presents an algorithm for generating the sum of disjoint products by using binary decision diagram as well as certain ordering role of paths and Boolean algebra formulas. Compared with the one by using the binary decision diagrams only, this algorithm is much simpler and will generate fewer terms of the sum of disjoint products. Therefore, the algorithm for calculating system reliability is more efficient.