On Polynomial Bounds of Convergence for the Availability Factor
Probability
2015-12-07 v1
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.
Cite
@article{arxiv.1512.01275,
title = {On Polynomial Bounds of Convergence for the Availability Factor},
author = {Alexander Veretennikov and Galina Zverkina},
journal= {arXiv preprint arXiv:1512.01275},
year = {2015}
}
Comments
This report was presented at the conference Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2015) (eighteenth international scientific conference) - Moscow, Russia, 2015