Abstract
This paper describes a method for obtaining numerical information concerning the time-dependent behavior of stochastic processes such as those arising in queuing theory. The method leads to an approximate inverse of the Laplace transform. Examples are given of applications to transforms with known inverses, and the evolution of expected waiting time at a simple single-server queue is illustrated, both when there is a stationary solution and in the saturated case.