Classification of Markov chains describing the evolution of random strings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Classification of Markov chains describing the evolution of random strings

Abstract

We consider LIFO queue with several customer types, batch arrival and batch services. We get necessary and sufficient conditions for this queue to be ergodic, null recurrent and transient. These are given in terms of positive solutions of finite system of equations pi = Fi(p1, ..., pk), i = 1, ..., k, where Fi are polynomials with positive coefficients.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2022.pdf (743.93 Ko) Télécharger le fichier

Dates and versions

inria-00074649 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074649 , version 1

Cite

A. Gajrat, Vadim A. A. Malyshev, M.V. Menshikov. Classification of Markov chains describing the evolution of random strings. [Research Report] RR-2022, INRIA. 1993. ⟨inria-00074649⟩
44 View
51 Download

Share

Gmail Facebook X LinkedIn More