Reliability lower bounds for two-dimensional consecutive-\(k\)-out-of-\(n\): F systems
type: Item
instance of: scholarly article
title: Reliability lower bounds for two-dimensional consecutive-\(k\)-out-of-\(n\): F systems
zbMATH Open document ID: 1104.90016
DOI: 10.1016/S0305-0548(03)00079-0
author: Ta-Cheng Chen
author: Yi-Chih Hsieh
published in: Computers \& Operations Research
publication date: 2004-11-12T00:00:00Z
review text: A new system, namely consecutive-\(k\)-out-of-\(n\) : F system (or (one-di\-men\-si\-o\-nal) \(C(k,n : F)\) system), has caught much attention since 1980 [\textit{M. T. Chao, J. C. Fu, M. V. Koutras} [IEEE Trans. Reliab. 44, 120--127 (1995)]) due to the followings: \(C(k,n : F)\) system usually has much higher probability than the series system, and is less expensive than the parallel systems. The \(C(k,n : F)\) system consists of \(n\) linearly connected components, and it fails iff there are consecutive \(k\) or more than \(k\) components failed. Two-dimensional \(C(k,n : F)\) systems have received extensive research interest due to the main fact that it can be applied into various areas in the real world, e.g., safety monitoring systems, design of electronic devices, disease diagnosis, and pattern recognition. As known, recursive algorithms can be used to derive the exact system reliability. However, the computing time complexity is exponential and it is infeasible for larger systems. In this paper, with the use of ``artificial perfect components'', the authors successfully convert a two-dimensional \(C(k,n : F)\) system into a one-dimensional \(C(k,n : F)\) system. Then, based upon the exact formula for obtaining the better reliability of one-dimensional \(C(k,n : F)\) system, a simple formula is presented for the reliability lower bound of the two-dimensional \(C(k,n : F)\) system. Numerical results show the performance of the presented approach. In addition, the authors show that the proposed approach can be extended to the more general \(t\)-within-connected-\((r,s)\)-out-of-\((m,n)\) : F systems. An example shows the performance of the reliability lower bounds. The proposed technique could be useful for system designers and researchers in estimating the reliability lower bounds for \(t\)-within-connected-\((r,s)\)-out-of-\((m, n)\) : F systems.
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 2115373
zbMATH Keywords: consecutive-\(k\)-out-of-\(n\) : F system
zbMATH Keywords: one/two-dimensional \(C(k
zbMATH Keywords: n : F)\) system
zbMATH Keywords: reliability lower bounds
zbMATH Keywords: artificial perfect components
zbMATH Keywords: \(t\)-within-con\-ne\-c\-ted-\((r
zbMATH Keywords: s)\)-out-of-\((m
zbMATH Keywords: n)\) : F systems
MaRDI profile type: Publication
cites work: Economical Design of Large Consecutive-k-out-of-n:F Systems
cites work: Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
cites work: On Reliability of a Large Consecutive-k-out-of-n:F System with (k - 1)-step Markov Dependence
cites work: A limit theorem of certain repairable systems
cites work: The reliability of a large series system under Markov structure
cites work: Two-dimensional consecutive-k-out-of-n:F models
cites work: A reliability bound for 2-dimensional consecutive k-out-of-n: F systems
cites work: Comments, with reply, on "2-dimensional consecutive-k-out-of-n:F models" by A.A. Salvia and W.C. Lasher
cites work: Reliability of 2-dimensional consecutive-k-out-of-n:F systems
cites work: Reliability bounds for coherent structures with independent components
cites work: Compound poisson approximation in systems reliability
cites work: A Reliability Bound for Systems of Maintained, Interdependent Components
cites work: Reliability of a 2-dimensional \(k\)-within-consecutive-\(r\) \(\times\) \(s\)-out-of-\(m \times n:F\) system
full work available at URL: s0305-0548(03)00079-0
OpenAlex ID: W2046671536
description: scientific article; zbMATH DE number 2115373