Reduced systems in Markov chains and their applications in queueing theory

DOI10.1007/BF01158397zbMath0651.60096OpenAlexW2007855659MaRDI QIDQ1106566

U. Narayan Bhat, Ram Lal

Publication date: 1987

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158397

zbMATH Keywords

first passage timeexistence of reduced systems and their propertiessteady-state probabilities of a Markov chain

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (2)

Computing absorption probabilities for a Markov chain ⋮ Model checking for a class of weighted automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Reduced systems in Markov chains and their applications in queueing theory