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