Accuracy of the Minimal Cut Approximation of Reliability for k-Out-of-n Systems.

Abstract

The minimal cut lower bound for k-out-of-n systems is computed and compared with the true reliability of these systems. The size of the system, n, is increased; and selected degrees of system complexity, k/n, are studied. The resulting graphs of system reliability versus component reliability indicate that both size and complexity cause a deterioration of the approximation, but they also indicate that there is a limit to this deterioration. The minimal cut lower bound is then examined, theoretically, as the size of the system increases to infinity; and the limits of deterioration are obtained. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1971
Accession Number
AD0721219

Entities

People

  • Austin Eugene Chapman

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Reliability

Fields of Study

  • Engineering

Readers

  • Graph Algorithms and Convex Optimization.
  • Regression Analysis.
  • Software Engineering