On Polynomial Bounds of Convergence for the Availability Factor

Abstract

A computable estimate of the readiness coefficient for a standard binary-state system is established in the case where both working and repair time distributions possess heavy tails.

This report was presented at the conference Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2015) (eighteenth international scientific conference) - Moscow, Russia, 2015