Reliability of a linear connected-(r,s)-out-of-(m,n):F lattice system
Reliability of a linear connected-(r,s)-out-of-(m,n):F lattice system
复制标题
DOI：
10.1109/24.387391
复制
发表时间：
1995-06
影响因子：
5.9
通讯作者：
H. Yamamoto;M. Miyakawa
中科院分区：
文献类型：
--
作者：
H. Yamamoto;M. Miyakawa
一个线性连通-(r,s)-out- (m,n):F晶格系统，其组成元素与(m,n)-矩阵的元素一样有序，如果连通(r,s)-子矩阵中的所有组成元素都失效，则系统失效。本文提出了一种系统可靠性的递归算法Yamamoto-Miyakawa （YM）。YM算法需要O（s/sup m-r//spl middot/m/sup 2//spl middot/r/spl middot/n）计算时间。与现有方法的比较表明了该方法的有效性。我们证明了大系统的可靠性趋于exp（-/spl mu//spl middot//spl lambda//sup r/spl middot/s/）为n=/spl mu//spl middot/M/sup /spl eta/-1/, M/ spl rarr//spl infin/，如果每个组件都有失效概率/spl lambda//spl middot/M/sup /spl eta//(r/spl middot/s/)，其中/spl mu//spl lambda/ M/sup /spl eta//(r/spl middot/s/)为常数，/spl mu/>0, /spl lambda/>0, /spl eta/>s，或r/(r-1)>/spl eta/>1。>
A linear connected-(r,s)-out-of-(m,n):F lattice system has its components ordered like the elements of a (m,n)-matrix such that the system fails if all components in a connected (r,s)-submatrix fail. This paper proposes a recursive algorithm, named Yamamoto-Miyakawa (YM), for the system reliability. The YM algorithm requires O(s/sup m-r//spl middot/m/sup 2//spl middot/r/spl middot/n) computing time. Comparisons with the existing methods show its usefulness. We prove that the reliability of the large system tends to exp(-/spl mu//spl middot//spl lambda//sup r/spl middot/s/) as n=/spl mu//spl middot/M/sup /spl eta/-1/, m/spl rarr//spl infin/ if every component has failure probability /spl lambda//spl middot/M/sup /spl eta//(r/spl middot/s/), where /spl mu/, /spl lambda/, /spl eta/ are constant, /spl mu/>0, /spl lambda/>0, /spl eta/>s, or r/(r-1)>/spl eta/>1. >