摘要
本文应用分离节点的概念将图分解成两个子图，使通信网络端对可靠性的成功函数简化为两个子网络的可靠性成功子函数，并且进一步导出由子网络不交化表示的原网络的不交化表达式，最后得到通信网络更简便更紧凑的端对可靠性表达式，此简化方法适用于任意系统可靠性的计算．
This paper decomposes a graph into two subgraphs, using the concept of separable nodes. The success function of the symbolic terminal pair reliability of communication networks is simplified to the success function of two subnetworks. And further, the disjoint expression of original network is derived from subnetworks. Finally, the terminal pair reliability of the communication network is given. This simple method is appropriate for relability evaluation of all systems.
出处
《系统工程学报》
CSCD
1996年第3期47-53,共7页
Journal of Systems Engineering
基金
94邮电部24项目
关键词
通信网
可靠性
分解技术
separation of a node, subgraph, minimal path set, minimal cut set, disjoint term, terminal pair reliability
