More predictable, less predictable and stable counting processes

DOI10.2307/3214843zbMath0778.62087OpenAlexW2332115101MaRDI QIDQ5288012

Nader Ebrahimi

Publication date: 30 August 1993

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214843

zbMATH Keywords

reliabilityPoisson processrepairable systemsrenewal processpredictabilitycounting processesminimal repairsemi-Markov processdelayed renewal processIFR distributionexpected conditional Shannon entropy

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Reliability and life testing (62N05) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Prediction theory (aspects of stochastic processes) (60G25)

Related Items (1)

Predictability of operational processes over finite horizon

This page was built for publication: More predictable, less predictable and stable counting processes