Answers are grounded in this paper and cite their sources.
We assume that the successive service times in a single server queue with Poisson arrivals form an m-state semi-Markov process. The results for the M/G/ 1 queue are extended to this case. Both the time-dependence and the stationary solutions are discussed.
No takes yet. Share an insight, caveat, or question.
Marcel F. Neuts (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: