By Topic

Exact Reliability of a Linear Connected- (r,s) -out-of- (m,n) : F System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xian Zhao ; School of Management and Economics, Beijing Institute of Technology, Beijing, China ; Lirong Cui ; Wei Zhao ; Fen Liu

A linear connected-(r, s)-out-of-(m, n) : F system consists of m×n components arranged in m rows by n columns, and it fails iff there exists a r × s subsystem in which all components are failed. The linear connected-(r, s)-out-of-(m, n) : F system can be used for modeling engineering systems such as temperature feeler systems, supervision systems, etc. In this paper, a general method is proposed based on the finite Markov chain imbedding approach to study the exact reliability of a linear connected-(r, s)-out-of-(m, n) : F system. Then a new more efficient method, which reduces the size of the state space by combining some states into one state, is presented to reduce the computing time. Furthermore, three numerical examples are given. The first two numerical examples show that the proposed algorithm is efficient not only when the component states are i.i.d., but also when the component states are statistically independent and non-identically distributed. And the last numerical example shows that our method can be used to compute not only the reliability, but also the component importance.

Published in:

IEEE Transactions on Reliability  (Volume:60 ,  Issue: 3 )