DocumentCode
833330
Title
Computing consecutive-type reliabilities nonrecursively
Author
Shmueli, Galit
Author_Institution
Decision & Inf. Technol. Dept., Univ. of Maryland, College Park, MD, USA
Volume
52
Issue
3
fYear
2003
Firstpage
367
Lastpage
372
Abstract
The reliability of consecutive-type systems has been approached from various angles. A new method is presented for deriving exact expressions for the generating functions and the reliabilities of various consecutive-type systems. This method, based on Feller´s run theory, is easy to implement, and leads to both recursive and nonrecursive formulas for the reliability. The nonrecursive expression is especially advantageous for systems with numerous components. In comparison to the n (number of components) computations that the recursive formulas require, the nonrecursive formula only requires the computation of the roots of a polynomial of order k. The method is extended for computing generating functions and reliabilities of systems with multi-state components as well as systems with s-dependent components.
Keywords
consecutive system reliability; polynomials; reliability theory; Feller´s run theory; consecutive-type reliabilities; generating functions; multi-state components; nonrecursive computation; nonrecursive expression; nonrecursive formula; partial fraction expansion; polynomial roots; recursive formula; s-dependent components; Degradation; Electric breakdown; Embedded computing; Information technology; Polynomials; Probability; Reliability theory;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/TR.2003.817846
Filename
1248654
Link To Document