First passage times for Markov renewal processes and applications

DOI10.1007/BF02880061zbMath0997.60099MaRDI QIDQ1609562

Guang-Hui Hsu, Quan-Lin Li, Xue-Ming Yuan

Publication date: 15 August 2002

Published in: Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

Markov renewal processfirst passage timebusy periodbusy cycleuniform errorjoint transform

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov renewal processes, semi-Markov processes (60K15)

Related Items (1)

A \(BMAP/G/1\) retrial queue with a server subject to breakdowns and repairs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• First passage times for multidimensional denumerable state Markov processes
• From the matrix-geometric to the matrix-exponential
• The busy period of queues which have a matrix-geometric steady state probability vector
• Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions
• First passage times: Busy periods and waiting times
• The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
• Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
• New results on the single server queue with a batch markovian arrival process
• Numerical Computation of Sojourn-Time Distributions in Queuing Networks
• The distribution of the first passage time for the markov processes ofGI/M/LType
• First passage times and their algorithms for markov processes

This page was built for publication: First passage times for Markov renewal processes and applications