Évaluation des systèmes : phénomènes transitoires
Exact transient expectations for queueing networks
Formule du produit et décomposition de réseaux de files d'attente
Identités du type Baxter-Spitzer pour une classe de promenades aléatoires semi-markoviennes
Majoration des retards dans les réseaux ATM
Maximum length of a series in a Markovian binary sequence with an application to the description of a basketball game
The recurrence formulas for the probability distribution function of the maximum length of a series of 1's in a binary 0-1 Markovian sequence are analysed and the limiting distribution estimated. The result is used to test a semi-Markov model of basketball games.
Modélisation avec pivot pour une loi générale
Modelos multiestado de reemplazamiento con reparación imperfecta.
Gran parte de los autores que han escrito sobre políticas estocásticas de reemplazamiento, han estado frecuentemente manteniendo dos supuestos en los modelos por ellos presentados:a) el sistema sólo tiene dos estados posibles, unos de funcionamiento y otro de avería.b) tras la avería, el sistema es reparado o reemplazado, quedando "tan bien como nuevo".En este artículo se obtienen unas funciones de coste, para sistemas en los cuales no pueden mantenerse estos supuestos. A través de estas funciones...
Network of queues modeling in flexible manufacturing systems : a survey
On a mean reward from a common Markov replacement process
On a mean reward from a Markov replacement process with only one isolated class of recurrent states
On a modification of Rényi's traffic model
On limit properties of the reward from a Markov replacement process
On Markovian traffic with applications to TES processes.
On network flow equations and splitting formulas for sojourn times in queueing networks.
On self-optimizing control of Markov processes
On some limit properties of the reward from a Markov replacement process
On system reliability under random load of elements
On the number of word occurrences in a semi-Markov sequence of letters
Let a finite alphabet Ω. We consider a sequence of letters from Ω generated by a discrete time semi-Markov process We derive the probability of a word occurrence in the sequence. We also obtain results for the mean and variance of the number of overlapping occurrences of a word in a finite discrete time semi-Markov sequence of letters under certain conditions.
Opérateurs positifs et probabilités stationnaires