Sub-stochastic matrix analysis for bounds computation -- theoretical results

DOI10.1016/J.EJOR.2005.08.016zbMath1109.90076OpenAlexW1991534723MaRDI QIDQ852968

Patrice Moreaux, Serge Haddad

Publication date: 15 November 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.08.016

zbMATH Keywords

Markov processstochastic processstochastic boundstrong stochastic orderingsub-Markov chain

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Markov and semi-Markov decision processes (90C40) Theory of organizations, manpower planning in operations research (90B70)

Related Items (2)

Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach ⋮ Asynchronous composition of high level Petri Nets: A quantitative approach

Cites Work

• Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
• Sojourn times in finite Markov processes
• Computing bounds on steady state availability of repairable computer systems
• Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
• Bound computation of dependability and performance measures
• Bounding steady-state availability models with group repair and phase type repair distributions
• Bounding availability of repairable systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sub-stochastic matrix analysis for bounds computation -- theoretical results