On the Numerical Analysis of Inhomogeneous Continuous-Time Markov Chains

被引:29
作者
Arns, M. [1 ]
Buchholz, P. [1 ]
Panchenko, A. [1 ]
机构
[1] Tech Univ Dortmund, D-44221 Dortmund, Germany
关键词
inhomogeneous Markov chains; transient solution; numerical techniques; uniformization; POISSON PROCESSES; MODELS; UNIFORMIZATION; AVAILABILITY; SIMULATION; SYSTEMS;
D O I
10.1287/ijoc.1090.0357
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Inhomogeneous continuous-time Markov chains play an important role in different application areas. In contrast to homogeneous continuous-time Markov chains, where a large number of numerical analysis techniques are available and have been compared, few results about the performance of numerical techniques in the inhomogeneous case are known. This paper presents a new variant of the uniformization technique, the most efficient approach for homogeneous Markov chains. The new uniformization technique allows for the stable computation of strict bounds for the transient distribution of inhomogeneous continuous-time Markov chains, which is not possible with other numerical techniques that provide only an approximation of the distribution and asymptotic bounds. Furthermore, another variant of uniformization is presented that computes an approximation of the transient distribution and is shown to outperform standard differential equation solvers if transition rates change slowly.
引用
收藏
页码:416 / 432
页数:17
相关论文
共 23 条
[1]  
[Anonymous], 1995, Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
[2]  
[Anonymous], 1994, Introduction to the Numerical Solutions of Markov Chains
[3]  
[Anonymous], 2000, Simulation modeling and analysis
[4]  
[Anonymous], 1975, Introduction to Stochastic Processes
[5]  
[Anonymous], 2006, GNU Scientific Library Reference Manual
[6]  
Cellier F. E., 2006, Continuous System Simulation
[7]  
CLOTH L, 2007, P 37 INT C DEP SYST, P780
[8]   COMPUTING POISSON PROBABILITIES [J].
FOX, BL ;
GLYNN, PW .
COMMUNICATIONS OF THE ACM, 1988, 31 (04) :440-445
[9]   TRANSIENT SOLUTIONS IN MARKOVIAN QUEUING SYSTEMS [J].
GRASSMANN, WK .
COMPUTERS & OPERATIONS RESEARCH, 1977, 4 (01) :47-53
[10]   THE RANDOMIZATION TECHNIQUE AS A MODELING TOOL AND SOLUTION PROCEDURE FOR TRANSIENT MARKOV-PROCESSES [J].
GROSS, D ;
MILLER, DR .
OPERATIONS RESEARCH, 1984, 32 (02) :343-361