Conference paper
Bound-preserving composition for Markov reward models
David Daly, Peter Buchholz, et al.
QEST 2006
Paper
A preorder relation for Markov reward processes
Abstract
A new preorder relation is introduced that orders states of a Markov process with an additional reward structure according to the reward gained over any interval of finite or infinite length. The relation allows the comparison of different Markov processes and includes as special cases monotone and lumpable Markov processes. © 2007 Elsevier B.V. All rights reserved.
Related
HariGovind V. Ramasamy, Adnan Agbaria, et al.
IEEE TDSC
Conference paper
Performance of large low-associativity caches
Parijat Dube, Li Zhang, et al.
Performance Evaluation Review
Conference paper
A hybrid approach for large cache performance studies
David Daly, Parijat Dube, et al.
QEST 2011