SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Matrix Analysis and Applications / Volume 7 / Issue 2

SIAM. J. on Algebraic and Discrete Methods 7, pp. 258-264 (7 pages)

Simplified Reliabilities for Consecutive-$k$-out-of-$n$ Systems

F. K. Hwang

Full Text: Download PDF | Buy PDF (US$25) | View Cart
Reliabilities for consecutive-$k$-out-of-$n$ systems are typically given in the form of recursive equations. Some attempts have been made to use combinatorics to obtain closed-form solutions, but the solutions contain $k - 1$ summations. In this paper we obtain closed form solutions with one summation over $n/ k$ terms. For $k = 2$ we are able to eliminate all summations. We apply our result to compute the reliability of a $k$-loop computer network.

© 1986 Society for Industrial and Applied Mathematics

KEYWORDS

AMS Subject Headings

60C05, 90B25, 62N05

PUBLICATION DATA

ISSN

0895-4798 (print)  
1095-7162 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received November 08, 1984
Digital Object Identifier
http://dx.doi.org/10.1137/0607029

For access to fully linked references, you need to log in.

For access to citing articles, you need to log in.


Close

Your Recent History Recent History Help

Recently Viewed

  1. Simplified Reliabilities for Consecutive-$k$-out-of-$n$ Systems
  2. On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
  3. Stable Computation of the CS Decomposition: Simultaneous Bidiagonalization
  4. Block Tensor Unfoldings
  5. Why Lagrange Multipliers with Extreme Magnitudes Give Extrema of Definite Hermitian Forms on Quadric...
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close