Some Results for Uniformizable Semi-Markov Processes

From MaRDI portal





It is well known that finite Markov chains (M.C.s) in continuous time are uniformizable. That is, a finite M.C. in continuous time can be treated as an M.C. in discrete time with random Poisson transition epochs. In this paper, we see to what extent generalization of the uniformization to a class of semi-Markov Processes (S.M.P.s) is possible. A necessary condition under which S.M.P.s are uniformizable is provided. It is shown that an S.M.P. with dwell-time distributions depending only on the current state is uniformizable if and only if the distributions are compound geometric distributions having the same base distribution. It is also shown that if the distributions are of generalized phase type then an S.M.P. being uniformizable implies that it is an M.C. in continuous time. Some properties that are shared by a uniformizable S.M.P. and the associated M.C. in discrete time are also dito the system and begins to serve units, if any, that have arrived during the vacation. If no units have arrived, the server waits for a batch to arrive when an ordinary busy period is initiated. In Model II, if the server finds the system empty at the end of a vacation another independent vacation will start immediately. The server resumes service at the end of the cumulative period of a random number of successive vacations called the vacation period. Probability generating functions of queue size at epochs of departure and vacation termination for both the models have been obtained using the imbedded Markov chain technique. Corresponding results have been derived explicitly when service time has a phase-type distribution.











This page was built for publication: Some Results for Uniformizable Semi-Markov Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773020)