A direct algorithm for computing reliability of a consecutive-k cycle
A direct algorithm for computing reliability of a consecutive-k cycle
复制标题
计算连续k周期可靠性的直接算法
DOI：
10.1109/24.3716
复制
发表时间：
1988
影响因子：
5.9
通讯作者：
F. Hwang
中科院分区：
文献类型：
--
作者：
D. Du;F. Hwang
连续k循环是一个循环系统，当且仅当任意i个连续组件全部失效时，系统失效。连续k周期的可靠性通常由递归方程计算。然而，迄今为止提出的大多数循环递归方程涉及连续k条线的可靠性，需要两次传递，其中第一次传递仅计算线的可靠性。提出了一个只涉及循环的递归方程，它在形式上更简单，但在直观上更难理解。另一个优点是所提出的循环递归与先前提出的直线递归具有相同的形式。因此，对线和圈的统一处理是可能的。用这种统一的方法得到了2 >的线路可靠度和周期可靠度的显式解
A consecutive-k cycle is a circular system such that the system fails if and only if any i consecutive components all fail. Reliabilities for consecutive-k cycles are usually computed by recursive equations. However, most recursive equations proposed so far for the cycle involve reliabilities for consecutive-k lines, requiring two passes where the first pass computes only the line reliabilities. A recursive equation involving cycles only is proposed that is simpler in form but much harder to understand on intuitive grounds. Another advantage is that the proposed cycle recursion has the same form as a line recursion previously proposed. Thus a uniform treatment of lines and cycles is possible. This uniform approach is used to obtain some explicit solutions of both line and cycle reliabilities for 2 >