On Extreme Disentanglement of Clutters in the Polesskii Estimates of the Boundaries of Combinatorial Reliability of Random Binary Systems

  • Authors:

  • B. P. Filin

  • Affiliations:

  • Federal Center "All-Russian Research Institute of Problems of Civil Defence and Emergency Situations" of the Ministry of Emergency Situations, Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consideration was given to the so-called "Polesskii estimates" which define new, more accurate reliability boundaries of the random binary systems as compared with the classical Esary-Proshan estimates. As was later shown, these estimates can be further refined. By giving a simplified, that is, purely applied, interpretation of the formal Polesskii rules, the present author demonstrated that Polesskii's concepts in principle enable one to reach the maximum disentanglement of clutters, thus substantially approaching the reliability boundaries of the random binary systems. The results of comparing the Polesskii estimates with other possible lines to attack the approachment of the boundaries of combinatorial reliability of the random binary systems were presented.