An ergodic semi-Markov process with the structure represented by the full graph with loops, which simulates a digital control algorithm that generated transactions onto an object, is investigated. Elementary simplifications for reduction of semi-Markov processes are defined. Recursive procedure for reduction of initial semi-Markov process structure till the model, which includes selected states with its links only, is proposed. Formulae for recalculation of probabilities, weighted densities and expectations of time of switching to linked states are obtained. It is shown that recursive procedure may be used also for calculation of time expectation of return the process to one of selected states that simplified the task of evaluation of time ...
This paper presents new algorithms and accompanying tool support for analyzing interactive Markov ch...
In this paper, a polling model with finite queues to analyse a production system that is operating u...
The joint queue length process in polling systems with and without switchover times is studied. If t...
An ergodic semi-Markov process with the structure represented by the full graph with loops, which si...
We investigate a gated polling system with semi-linear feedback and Markovian routing. We thereby re...
We devise an approximation of the marginal queue length distribution in discrete-time polling system...
This study is devoted to a queueing analysis of polling systems with a probabilistic server routing ...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
Abstract. In this paper, we will develop a general framework to analyze polling systems with either ...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
In this paper, we will develop a general framework to analyze polling systems with either the autono...
This thesis examines Recursive Markov Chains (RMCs), their natural extensions and connection to othe...
This thesis examines Recursive Markov Chains (RMCs), their natural extensions and connection to othe...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
This paper presents new algorithms and accompanying tool support for analyzing interactive Markov ch...
In this paper, a polling model with finite queues to analyse a production system that is operating u...
The joint queue length process in polling systems with and without switchover times is studied. If t...
An ergodic semi-Markov process with the structure represented by the full graph with loops, which si...
We investigate a gated polling system with semi-linear feedback and Markovian routing. We thereby re...
We devise an approximation of the marginal queue length distribution in discrete-time polling system...
This study is devoted to a queueing analysis of polling systems with a probabilistic server routing ...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
Abstract. In this paper, we will develop a general framework to analyze polling systems with either ...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
In this paper, we will develop a general framework to analyze polling systems with either the autono...
This thesis examines Recursive Markov Chains (RMCs), their natural extensions and connection to othe...
This thesis examines Recursive Markov Chains (RMCs), their natural extensions and connection to othe...
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalize...
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the tim...
This paper presents new algorithms and accompanying tool support for analyzing interactive Markov ch...
In this paper, a polling model with finite queues to analyse a production system that is operating u...
The joint queue length process in polling systems with and without switchover times is studied. If t...