Computational Complexity of Coherent Systems and the Reliability Polynomial.

Abstract

There are three general methods for system reliability evaluation, namely: 1) Inclusion-Exclusion, 2) Sum of Disjoint Products, and 3) Pivoting. Of these, only pivoting can be applied directly to a logic tree or network graph representation without first finding minimal path (or cut) sets. Domination theory provides the basis for selecting optimal pivoting strategies. Simple proofs of domination theory results for coherent systems are given, based on the reliability polynomial. These results are related to the problem of finding efficient strategies for computing coherent system reliability. The original results for undirected networks are due to Satyanarayana and Chang (1983). Many of the original set theoretic results are due to Huseby (1984). However, he does not use the reliability polynomial to prove his results. Additional keywords: Operation's research. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1985
Accession Number
ADA158689

Entities

People

  • R. E. Barlow
  • Srikanth Iyer

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • California
  • Classification
  • Coefficients
  • Complex Systems
  • Computational Complexity
  • Industrial Engineering
  • Operations Research
  • Polynomials
  • Procurement
  • Reliability
  • Scientific Research
  • Security
  • United States
  • United States Government
  • Universities

Fields of Study

  • Engineering

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Graph Algorithms and Convex Optimization.
  • Software Engineering