First passage times for multidimensional denumerable state Markov processes
From MaRDI portal
Publication:701633
DOI10.1007/BF02886012zbMath1005.90557MaRDI QIDQ701633
Publication date: 19 February 2003
Published in: Chinese Science Bulletin (Search for Journal in Brave)
Related Items (3)
Busy period for the first subsystem in a matched queueing network ⋮ Algorithms for Markov stochastic models ⋮ First passage times for Markov renewal processes and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Transient solutions for multidimensional denumerable state Markov processes
- 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 multidimensional denumerable state Markov processes