On a one-line serving system having a finite capacity with phase distributions and absolute priority

A one-line service system is taken up which has a finite capacity and receives two recurrent customer flows. The intervals between arrivals of customers of either flow and the duration of their service have phase distributions. Customers of the first one have an absolute priority, interrupted services of the other flow are started anew. For the Markov process which describes this system a matrix recurrent algorithm is obtained for computing stationary probabilities of system states at the current time and at the times of customer arrival in or departure from, the system.