A consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is...A consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is an O(n k). Further more, the system's reliability can be computed more quickly and more effectively from this formula than those previously given.展开更多
文摘A consecutive k out of n: F System, with n linearly arranged i. i. d. components, is examined. This paper gives an exact formula for computing the system's reliability directly. Complexity of this algorithm is an O(n k). Further more, the system's reliability can be computed more quickly and more effectively from this formula than those previously given.
