An MAP(2)/G(2)/1/r queue system with absolute priority

A single-server queue system with limited waiting room is studied. Two Markov inputs arrive at the system. Their service times have arbitrary distribution functions, different for different input types. The customers of the first input have absolute priority, and a customer whose service is interrupted is served anew. A matrix algorithm is designed for computing the stationary probabilities of the states at arbitrary instants, as well as at customer arrival or service termination instants.