Empirical comparison of uniformization methods for continuous-time Markov chains.

*(English)*Zbl 0862.60061
Stewart, William J. (ed.), Computations with Markov chains. Proceedings of the 2nd international workshop on the numerical solution of Markov chains, Raleigh, NC, USA, January 16–18, 1995. Boston, MA: Kluwer Academic Publishers. 547-570 (1995).

Summary: Computation of transient state occupancy probabilities of continuous-time Markov chains is important for evaluating many performance, dependability, and performability models. A number of numerical methods have been developed to perform this computation, including ordinary differential equation solution methods and uniformization. The performance of these methods degrades when the highest departure rate in the chain increases with respect to a fixed time point. A new variant of uniformization, called adaptive uniformization (AU), has been proposed that can potentially avoid such degradation, when several state transitions must occur before a state with a high departure rate is reached. However, in general, AU has a higher time complexity than standard uniformization, and it is not clear, without an implementation, when AU will be advantageous. This paper presents the results of three different AU implementations, differing in the method by which the “jump probabilities” are calculated. To evaluate the methods, relative to standard uniformization, a C++ class was developed to compute a bound on the round-off error incurred by each implementation, as well as count the number of arithmetic instructions that must be performed, categorized both by operation type and phase of the algorithm they belong to. An extended machine-repairman reliability model is solved to illustrate use of the class and compare the adaptive uniformization implementations with standard uniformization. Results show that for certain models and mission times, adaptive uniformization can realize significant efficiency gains, relative to standard uniformization, while maintaining the stability of standard uniformization.

For the entire collection see [Zbl 0940.00042].

For the entire collection see [Zbl 0940.00042].

##### MSC:

60J27 | Continuous-time Markov processes on discrete state spaces |

##### Keywords:

state occupancy probabilities; numerical methods; adaptive uniformization; machine-repairman reliability model
PDF
BibTeX
XML
Cite

\textit{J. D. Diener} and \textit{W. H. Sanders}, in: Computations with Markov chains. Proceedings of the 2nd international workshop on the numerical solution of Markov chains, Raleigh, NC, USA, January 16--18, 1995. Boston, MA: Kluwer Academic Publishers. 547--570 (1995; Zbl 0862.60061)