The Efficiency of Computing the Reliability of k-out-of-n Systems

Shambhu J. Upadhyaya; Hoang Pham

doi:10.1109/24.9875

The Efficiency of Computing the Reliability of k-out-of-n Systems

Shambhu J. Upadhyaya
, Hoang Pham

Department of Computer Science and Engineering

SUNY Buffalo

Research output: Contribution to journal › Article › peer-review

26 Scopus citations

Abstract

We show that the Barlow & Heidtmann algorithm for computing the reliability of k-out-of-n systems supersede the results presented in the two recent publications by Jain & Gopal and Rai et al. We measure efficiency by the number of multiplications.

Original language	English
Pages (from-to)	521-523
Number of pages	3
Journal	IEEE Transactions on Reliability
Volume	37
Issue number	5
DOIs	https://doi.org/10.1109/24.9875
State	Published - Dec 1988

Keywords

Computational complexity
k-out-of-n system

Access to Document

10.1109/24.9875

Cite this

@article{fa771a851bf941a3b5ab26d97d281df2,

title = "The Efficiency of Computing the Reliability of k-out-of-n Systems",

abstract = "We show that the Barlow \& Heidtmann algorithm for computing the reliability of k-out-of-n systems supersede the results presented in the two recent publications by Jain \& Gopal and Rai et al. We measure efficiency by the number of multiplications.",

keywords = "Computational complexity, k-out-of-n system",

author = "Upadhyaya, \{Shambhu J.\} and Hoang Pham",

year = "1988",

month = dec,

doi = "10.1109/24.9875",

language = "English",

volume = "37",

pages = "521--523",

journal = "IEEE Transactions on Reliability",

issn = "0018-9529",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - The Efficiency of Computing the Reliability of k-out-of-n Systems

AU - Upadhyaya, Shambhu J.

AU - Pham, Hoang

PY - 1988/12

Y1 - 1988/12

N2 - We show that the Barlow & Heidtmann algorithm for computing the reliability of k-out-of-n systems supersede the results presented in the two recent publications by Jain & Gopal and Rai et al. We measure efficiency by the number of multiplications.

AB - We show that the Barlow & Heidtmann algorithm for computing the reliability of k-out-of-n systems supersede the results presented in the two recent publications by Jain & Gopal and Rai et al. We measure efficiency by the number of multiplications.

KW - Computational complexity

KW - k-out-of-n system

UR - https://www.scopus.com/pages/publications/0024175674

U2 - 10.1109/24.9875

DO - 10.1109/24.9875

M3 - Article

AN - SCOPUS:0024175674

SN - 0018-9529

VL - 37

SP - 521

EP - 523

JO - IEEE Transactions on Reliability

JF - IEEE Transactions on Reliability

IS - 5

ER -

The Efficiency of Computing the Reliability of k-out-of-n Systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this