التفاصيل البيبلوغرافية
| العنوان: |
Computing Consecutive-Type Reliabilities Non-Recursively. |
| المؤلفون: |
Shmueli, Galit1 GShmuli@rhsmith.umd.edu |
| المصدر: |
IEEE Transactions on Reliability. Sep2003, Vol. 52 Issue 3, p367-372. 6p. |
| مصطلحات موضوعية: |
*RELIABILITY in engineering, *SYSTEMS engineering, GENERATING functions, COMBINATORICS |
| مستخلص: |
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 comportents as well as systems with s-dependent components. Consecutive system, nonrecursive reliability, parrial fraction expansion, recurrence relation, system reliability. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Reliability is the property of IEEE and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
