Reduced systems in Markov chains and their applications in queueing theory
From MaRDI portal
Publication:1106566
DOI10.1007/BF01158397zbMath0651.60096MaRDI QIDQ1106566
Publication date: 1987
Published in: Queueing Systems (Search for Journal in Brave)
first passage time; existence of reduced systems and their properties; steady-state probabilities of a Markov chain
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Related Items
Model checking for a class of weighted automata, Computing absorption probabilities for a Markov chain
Cites Work
- An algorithmic approach for a special class of Markov chains
- Algorithms for finding steady state probabilities for some special classes of finite state Markov chains
- Which linear compartmental systems contain traps?
- Finite Markov chain models skip-free in one direction
- Asymptotic behavior of the stationary distributions in the GI/PH/c queue with heterogeneous servers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item