The Community for Technology Leaders
Quantitative Evaluation of Systems, International Conference on (2004)
Enschede, the Netherlands
Sept. 27, 2004 to Sept. 30, 2004
ISBN: 0-7695-2185-1
pp: 136-145
Vinh V. Lam , University of Illinois at Urbana-Champaign
Peter Buchholz , Universit?t Dortmund, Germany
William H. Sanders , University of Illinois at Urbana-Champaign
ABSTRACT
Structured (a.k.a. symbolic) representation techniques of Markov models have, to a large extent, been used effectively for representing very large transition matrices and their associated state spaces. However, their success means that the largest space requirement encountered when analyzing these models is often the representation of their iteration and solution vectors. In this paper, we present a new approach for computing bounds on solutions of transient measures in large continuous-time Markov chains (CTMCs). The approach extends existing path- and uniformization-based methods by identifying sets of paths that are equivalent with respect to a reward measure and related to one another via a simple structural relationship. This relationship allows us to explore multiple paths at the same time, thus significantly increasing the number of paths that can be explored in a given amount of time. Furthermore, the use of a structured representation for the state space and the direct computation of the desired reward measure (without ever storing the solution vector) allow us to analyze very large models using a very small amount of storage. In addition to presenting the method itself, we illustrate its use to compute the reliability and the availability of a large distributed information service system in which faults may propagate across subsystems.
INDEX TERMS
null
CITATION

V. V. Lam, W. H. Sanders and P. Buchholz, "A Structured Path-Based Approach for Computing Transient Rewards of Large CTMCs," Quantitative Evaluation of Systems, International Conference on(QEST), Enschede, the Netherlands, 2004, pp. 136-145.
doi:10.1109/QEST.2004.10003
96 ms
(Ver 3.3 (11022016))