Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-27T23:54:14.808Z Has data issue: false hasContentIssue false
  • English
  • Français

On a class of continuous-time Markov processes

Published online by Cambridge University Press:  14 July 2016

J. Gani  and
Pyke Tin
J. Gani
Affiliation:
University of Kentucky
Pyke Tin*
Affiliation:
University of Rangoon
*
∗∗ Postal address: Department of Mathematics, University of Rangoon, Rangoon, Burma.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper considers a certain class of continuous-time Markov processes, whose time-dependent and stationary distributions are studied. In the stationary case, the analogy with Whittle's relaxed Markov process is pointed out. The derivation of the probability generating functions of the general process provides useful results for the analysis of some population and queueing processes.

Keywords

RELAXED MARKOV PROCESSESSTATIONARY PROBABILITIES
Type
Research Papers
Information
Journal of Applied Probability , Volume 22 , Issue 4 , December 1985 , pp. 804 - 815
Copyright
Copyright © Applied Probability Trust 1985 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

∗

Present address: Statistics Program, Department of Mathematics, University of California at Santa Barbara, Santa Barbara, CA 93106, USA.

References

Copson, E. T. (1962) Introduction to the Theory of Functions of a Complex Variable. Clarendon Press, Oxford.Google Scholar
Garg, R. L. and Khamma, S. K. (1983) Queue dependent additional server queueing problem with batch arrivals. RAIRO Rech. Operat. 17, 391–398.CrossRefGoogle Scholar
Singh, V. P. (1973) Queue dependent servers. J. Eng. Math. 7, 123–126.Google Scholar
Whittle, P. (1983) Relaxed Markov processes. Adv. Appl. Prob. 15, 769–782.Google Scholar