On Polynomial Bounds of Convergence for the Availability Factor
classification
🧮 math.PR
keywords
availabilitybinary-stateboundscasecoefficientcomputableconvergencedistributions
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.