More predictable, less predictable and stable counting processes

DOI10.2307/3214843MaRDI QIDQ5288012zbMATH OpenOpenAlexFDO

Authors 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

counting processesdelayed renewal processexpected conditional Shannon entropyIFR distributionminimal repairPoisson processpredictabilityreliabilityrenewal processrepairable systemssemi-Markov process

Mathematics Subject Classification ID

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

Recommendations

• Predictability of operational processes over finite horizon
• On reliability prediction and semi-renewal processes
• On stochastic predictions of failure processes under population heterogeneity
• Ordering of repairable systems
• On Fault Predictability in Stochastic Discrete Event Systems

Cited in

(3)

• Predictive Inference and Discontinuities
• Scoring probability forecasts for point processes: the entropy score and information gain
• Predictability of operational processes over finite horizon

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

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