Article ID: | iaor2013104 |
Volume: | 202 |
Issue: | 1 |
Start Page Number: | 35 |
End Page Number: | 58 |
Publication Date: | Jan 2013 |
Journal: | Annals of Operations Research |
Authors: | Buchholz Peter, Telek Mikls |
Keywords: | stochastic processes, markov processes |
Rational Arrival Processes (RAPs) form a general class of stochastic processes which include Markovian Arrival Processes (MAPs) as a subclass. In this paper we study RAPs and their representations of different sizes. We show some transformation methods between different representations and present conditions to evaluate the size of the minimal representation. By using some analogous results from linear systems theory, a minimization approach is defined which allows one to transform a RAP (from a redundant high dimension) into one of its minimal representations. An algorithm for computing a minimal representation is also given. Furthermore, we extend the approach to RAPs with batch arrivals (BRAPs) and to RAPs with arrivals of different customer types (MRAPs).