Application of the majority connectedness carrier for computing the reliability of complex systems

  • Authors:

  • V. N. Kononenko;R. M. Lozitskii;M. V. Nosov;A. S. Romanov;B. P. Filin

  • Affiliations:

  • Agency for Monitoring and Forecast of Emergency Situations, Moscow, Russia;Central Testing and Research Institute no. 16, Moscow, Russia;Civil Protection Academy of the Ministry of Emergency Situations, Moscow, Russia;Agency for Monitoring and Forecast of Emergency Situations, Moscow, Russia;Agency for Monitoring and Forecast of Emergency Situations, Moscow, Russia

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

A computational method for probability of majority connectedness of the two-pole network of a random graph is stated when the union of circuits is used as a connectedness carrier of node-poles. Formal rules for calculations of this type illustrated by the corresponding examples are given.