This work main objective is to present a process to compute the Markov renewal matrix R(t) for Markov renewal processes with infinite coutable states space, which semi-Markov matrixes Q(t) are immigration and death type and assume a tridiagonal form. These processes occur often in practical applications. And the difficulty in obtaining friendly results for R(t) is a great obstacle to its application in practical cases modelling. It is exemplified the application to the M/M/oo queue particular case. The work presented in (5) is resumed but now the emphasis is put in the determination of pfaffian solutionthat must be considered in this example.info:eu-repo/semantics/publishedVersio
Abstract The M/M/k/setup model, where there is a penalty for turning servers on, is common in data c...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varie...
This work main objective is to present a process to compute the Markov renewal matrix R(t) for Marko...
The main objective of this work is to present a process to compute the Markov renewal matrix R(t) fo...
We investigate some modern matrix methods for the solution of finite state stochastic models with an...
AbstractThis paper is concerned with single server queueing systems with renewal service process and...
Markov renewal processes with semi-Markov kernel matrices that have matrix-exponential representatio...
A dual form of Markov renewal equation and its application to asymptotic analysis of the single-serv...
Markov renewal processes with matrix-exponential semi-Markov kernels provide a generic tool for mode...
Analytical methods for tractable (Markov) queueing models commonly assume Poisson arrivals and expon...
We present three classical methods in the study of dynamic and stationary characteristic of processe...
International audienceWe study the time evolution of an increasing stochastic process governed by a ...
Vita.Markov renewal theory, a branch of probability theory, is based on the properties of regenerati...
[[abstract]]In this paper, we consider a family of M(t)/M/1 queues in which customers arrive accordi...
Abstract The M/M/k/setup model, where there is a penalty for turning servers on, is common in data c...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varie...
This work main objective is to present a process to compute the Markov renewal matrix R(t) for Marko...
The main objective of this work is to present a process to compute the Markov renewal matrix R(t) fo...
We investigate some modern matrix methods for the solution of finite state stochastic models with an...
AbstractThis paper is concerned with single server queueing systems with renewal service process and...
Markov renewal processes with semi-Markov kernel matrices that have matrix-exponential representatio...
A dual form of Markov renewal equation and its application to asymptotic analysis of the single-serv...
Markov renewal processes with matrix-exponential semi-Markov kernels provide a generic tool for mode...
Analytical methods for tractable (Markov) queueing models commonly assume Poisson arrivals and expon...
We present three classical methods in the study of dynamic and stationary characteristic of processe...
International audienceWe study the time evolution of an increasing stochastic process governed by a ...
Vita.Markov renewal theory, a branch of probability theory, is based on the properties of regenerati...
[[abstract]]In this paper, we consider a family of M(t)/M/1 queues in which customers arrive accordi...
Abstract The M/M/k/setup model, where there is a penalty for turning servers on, is common in data c...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varie...