k-within-consecutive-(r, s)-out-of-(m, n):F system. The feature of this algorithm is calculating their system reliabilities with shorter computing time and smaller memory size than Akiba and Yamamoto. Next, we show some numerical examples so that our proposed algorithm is more effective than Akiba and Yamamoto for systems with large n." />


Efficient Algorithm for the Reliability of a 2-Dimensional Cylindrical k-within-Consecutive-(r, s)-out-of-(m, n):F System

Hisashi YAMAMOTO  Tomoaki AKIBA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E87-A   No.5   pp.1251-1257
Publication Date: 2004/05/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Reliability, Maintainability and Safety Analysis
Keyword: 
2-dimensional cylindrical k-within-consecutive-(r,s)-out-of-(m,n):F system,  system reliability,  recursive algorithm,  

Full Text: PDF>>
Buy this Article




Summary: 
A 2-dimensional cylindrical k-within-consecutive-(r, s)-out-of-(m, n):F system consists of m n components arranged on a cylindrical grid. Each of m circles has n components, and this system fails if and only if there exists a grid of size r s within which at least k components are failed. This system may be used into reliability models of "Feelers for measuring temperature on reaction chamber," "TFT Liquid Crystal Display system with 360 degree wide area" and others. In this paper, first, we propose an efficient algorithm for the reliability of a 2-dimensional cylindrical k-within-consecutive-(r, s)-out-of-(m, n):F system. The feature of this algorithm is calculating their system reliabilities with shorter computing time and smaller memory size than Akiba and Yamamoto. Next, we show some numerical examples so that our proposed algorithm is more effective than Akiba and Yamamoto for systems with large n.