【摘要】 基于不交最小割求解系统失效概率的思想,提出了求解网络系统失效概率的最小割递推分解算法。在此基础上,利用概率不等式给出了失效概率的上、下界,从而可以通过控制上、下界之间的误差来获得计算精度和计算时间之间的平衡。计算实例分析表明,该算法能计算给出中、小型网络失效概率的精确值,并能够高效、高精度地求解出大型复杂网络系统的失效概率。更多还原

【Abstract】 In this paper,a minimal cut-based recursive decomposition algorithm is presented to calculate the failure probability of network system.In the algorithm,a complementary structural function is established.During the process of decomposing the complementary structural function,the disjoint minimal cuts and the disjoint minimal paths are obtained one by one.Once all disjoint minimal cuts are decomposed,the failure probability of the network can be calculated by adding the probability of all disjoint minimal cuts.For large-scale network,as it is impossible to decompose all disjoint minimal cuts of the network,the probability inequality can be used to evaluate the approximate solution which satisfies a prescribed error bound.The results of two examples show that the suggested algorithm can calculate the failure probability of the system with high accuracy and high efficiency.更多还原