Computational Performance Bounds for Markov Chains With Applications

DOI10.1109/TAC.2008.921013MaRDI QIDQ4974248zbMATH OpenFDO

Authors P. R. Kumar, James R. Morrison

Publication date 8 August 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2008.921013

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Linear programming (90C05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Cited in

(5)

• Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• Approximate linear programming for networks: average cost bounds
• scientific article; zbMATH DE number 4156195 (Why is no real title available?)
• Computing stationary expectations in level-dependent QBD processes

This page was built for publication: Computational Performance Bounds for Markov Chains With Applications

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