Transient Markov arrival processes
Authors:
- Guy LatoucheGLGuy Latouche
- Marie-Ange RemicheMRMarie-Ange Remiche
- Peter TaylorPTPeter Taylor
Open Access
- 1 May 2003
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 13 (2) , 628-640
Abstract
We define the family of transient Markov arrival processes (transient MAPs) which combine features of transient (or terminating) renewal processes and of the well-known MAPs: transient MAPs are point processes on the line, controlled by a finite Markov chain, which almost surely comprise a finite number of points. We analyze their basic properties.Keywords
This publication has 12 references indexed in Scilit:
- On the exact distribution of the Isotropic Planar Point Processes of Phase typeJournal of Computational and Applied Mathematics, 2000
- Spatial point patterns of phase type1997
- A closure characterisation of phase-type distributionsJournal of Applied Probability, 1992
- A unified stochastic model for the packet stream from periodic sourcesPerformance Evaluation, 1992
- The first two moment matrices of the counts for the markovian arrival processCommunications in Statistics. Stochastic Models, 1992
- Continuous-Time Markov Chains1991
- A single-server queue with server vacations and a class of non-renewal arrival processesAdvances in Applied Probability, 1990
- Proc symp on congestion theoryCommunications in Statistics. Stochastic Models, 1990
- Finite birth-and-death models in randomly changing environmentsAdvances in Applied Probability, 1984
- A versatile Markovian point processJournal of Applied Probability, 1979