On Polynomial Bounds of Convergence for the Availability Factor

TL;DR

This paper provides a computable estimate for the availability of systems with heavy-tailed working and repair times, enhancing understanding of system reliability under such conditions.

Contribution

It introduces a new polynomial bound on the convergence rate of the availability factor for systems with heavy-tailed distributions.

Findings

Established a polynomial convergence bound for availability

Applicable to systems with heavy-tailed distributions

Improves reliability estimates for complex systems

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.