On Polynomial Bounds of Convergence for the Availability Factor

DOI10.1007/978-3-319-30843-2_37zbMATH Open1392.60074arXiv1512.01275OpenAlexW2262037622MaRDI QIDQ4568367FDOQ4568367

A. Yu. Veretennikov, Galina Zverkina

Publication date: 21 June 2018

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1512.01275

zbMATH Keywords

heavy tailspolynomial convergence raterestorable systemreadiness coefficient

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A maximal coupling for Markov chains
• Certain Properties of Piecewise-Linear Markov Processes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• On Strong Bounds of Rate of Convergence for Regenerative Processes

This page was built for publication: On Polynomial Bounds of Convergence for the Availability Factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568367)