计算网络 SKT 可靠性的一个新拓扑公式

A New Toplogical Formula for Computing SKT Reliability of Networks

提出计算网络从源点到某些特定终点（ＳＫＴ）的可靠性的一个新拓扑公式．该公式本质上是将容斥原理公式和不交和公式融合在一起，公式中各项和网络的一类特殊子网络一一对应，与相应的Ｓａｔｙａｎａｒａｙａｎｎａ公式比较，该公式包含更少的项和更少的算术运算，并给出一个算例验证上述这个结论．

A new toplogical formula for Computing SKT reliability of networks from source to Kterminals was presented. Combining InclusionExclusion principle with Disjoint Sum of products formula,the new formula contains terms which correpond one by one to a class of special subnetworks. For a given newtork,terms of new formula are fewer than those of corresponding stryanarayna formula. Finally,an example illustrates our conclusion.