GENERALIZED CLASS [script C] MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS
From MaRDI portal
Publication:3444650
DOI10.1017/S0269964807070155zbMath1120.60068MaRDI QIDQ3444650
Ana Bušić, Nihal Pekergin, Mouad Ben Mamoun
Publication date: 4 June 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Computational methods in Markov chains (60J22) Inequalities; stochastic orderings (60E15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- Monotone matrices and monotone Markov processes
- Bounds and error bounds for queueing networks
- Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
- Computing bounds on steady state availability of repairable computer systems
This page was built for publication: GENERALIZED CLASS [script C] MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS
