Taylor series of the M/M/1 queueing system

A Taylor series method for determining the transient probabilities of the classical single server queueing system is presented. The method is direct, practical and avoids Bessel function theory, Laplace transform theory and complex analysis. The resulting Taylor series are proved to converge for all time under arbitrary initial conditions. A method to obtain explicit Taylor series representations is demonstrated.