摘要
:从最小割出发 ,应用不交和的方法研究了不可修线形连续k out of n :F系统 ,得到了系统的失效概率计算公式 ,该算法的复杂度为O(nk)。
Starting from the minimum cut set,a study is conducted on the unrepairable linear consecutive k out of n:F System using the sum of disjoint method.A probability formula to compute the system unreliability is deduced with complexity of O(nk).
出处
《南京邮电学院学报》
2000年第1期25-29,共5页
Journal of Nanjing University of Posts and Telecommunications(Natural Science)
关键词
系统失效概率
连续系统
可靠性
K-out-of-n:F system
Minimal cut
Sum of disjoint products,Unreliability of system
