Markov regenerative processes are continuous‐time stochastic processes with more general conditions of regeneration than regenerative processes. The limiting behavior of some queues with general distributions can be obtained using Markov regenerative argument. In this article, after some basic definitions, some results related to the transient and limiting properties of the Markov regenerative processes are given. Some results are demonstrated with examples
In this paper we study a queueing model of type GI/M/m̃a/ ∞ with m parallel channels, some of which ...
In this paper we generalize a method (called regenerative randomization) for the transient solution ...
Randomization is a popular method for the transient solution of continuous-time Markov models. Its p...
We review the theory of regenerative processes, which are processes that can be intuitively seen as ...
Ergodicity, continuity, finite approximations and rare visits of general Markov chains are investiga...
We present three classical methods in the study of dynamic and stationary characteristic of processe...
Vita.Markov renewal theory, a branch of probability theory, is based on the properties of regenerati...
We consider a single server queue with the interarrival times and the service times forming a regene...
A semi‐Markov process is a generalization of continuous‐time Markov chain, so that the sojourn times...
Markov regenerative processes (MRGPs) constitute a more general class of stochastic pr cesses than t...
The purpose of this thesis is to study, by using techniques of regenerative processes, the problem o...
We study a class of Markov processes that combine local dynamics, arising from a fixed Markov proces...
AbstractNew types of mixed large deviation and ergodic theorems are obtained for nonlinearly perturb...
AbstractThis paper deals with characterizations for the distributional regeneration of general Marko...
This thesis consists of four papers. In paper 1, we prove central limit theorems for Markov chains u...
In this paper we study a queueing model of type GI/M/m̃a/ ∞ with m parallel channels, some of which ...
In this paper we generalize a method (called regenerative randomization) for the transient solution ...
Randomization is a popular method for the transient solution of continuous-time Markov models. Its p...
We review the theory of regenerative processes, which are processes that can be intuitively seen as ...
Ergodicity, continuity, finite approximations and rare visits of general Markov chains are investiga...
We present three classical methods in the study of dynamic and stationary characteristic of processe...
Vita.Markov renewal theory, a branch of probability theory, is based on the properties of regenerati...
We consider a single server queue with the interarrival times and the service times forming a regene...
A semi‐Markov process is a generalization of continuous‐time Markov chain, so that the sojourn times...
Markov regenerative processes (MRGPs) constitute a more general class of stochastic pr cesses than t...
The purpose of this thesis is to study, by using techniques of regenerative processes, the problem o...
We study a class of Markov processes that combine local dynamics, arising from a fixed Markov proces...
AbstractNew types of mixed large deviation and ergodic theorems are obtained for nonlinearly perturb...
AbstractThis paper deals with characterizations for the distributional regeneration of general Marko...
This thesis consists of four papers. In paper 1, we prove central limit theorems for Markov chains u...
In this paper we study a queueing model of type GI/M/m̃a/ ∞ with m parallel channels, some of which ...
In this paper we generalize a method (called regenerative randomization) for the transient solution ...
Randomization is a popular method for the transient solution of continuous-time Markov models. Its p...
DOI
Add to ORKG