Related papers: A M|M|m|m Queue System Transient Behavior Study
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
The dynamics of pedestrian crowds has been studied intensively in recent years, both theoretically and empirically. However, in many situations pedestrian crowds are rather static, e.g. due to jamming near bottlenecks or queueing at ticket…
We present a theoretical method to generate a highly accurate {\em time-independent} Hamiltonian governing the finite-time behavior of a time-periodic system. The method exploits infinitesimal unitary transformation steps, from which…
This paper presents a simple model that mimics quantum mechanics (QM) results without using complex wavefunctions or non-localities. The proposed model only uses integer-valued quantities and arithmetic operations, in particular assuming a…
Branching processes are a class of continuous-time Markov chains (CTMCs) prevalent for modeling stochastic population dynamics in ecology, biology, epidemiology, and many other fields. The transient or finite-time behavior of these systems…
Modeling biological processes is a highly demanding task because not all processes are fully understood. Mathematical models allow us to test hypotheses about possible mechanisms of biological processes. The mathematical mechanisms…
Quantitative properties of stochastic systems are usually specified in logics that allow one to compare the measure of executions satisfying certain temporal properties with thresholds. The model checking problem for stochastic systems with…
Queuing models provide insight into the temporal inhomogeneity of human dynamics, characterized by the broad distribution of waiting times of individuals performing tasks. We study the queuing model of an agent trying to execute a task of…
We introduce an efficient MCMC sampling scheme to perform Bayesian inference in the M/G/1 queueing model given only observations of interdeparture times. Our MCMC scheme uses a combination of Gibbs sampling and simple Metropolis updates…
We study three non-equivalent queueing models in continuous time that each generalise the classical M/M/1 queue in a different way. Inter-event times in all models are Mittag-Leffler distributed, which is a heavy tail distribution with no…
We study approximation of non-autonomous linear differential equations with variable delay over infinite intervals. We use piecewise constant argument to obtain a corresponding discrete difference equation. The study of numerical…
A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair and each link has a per-time-unit capacity and a transit time. A dynamic…
This paper assesses the transient stability of a synchronous machine connected to an infinite bus through the notion of invariant sets. The problem of computing a conservative approximation of the maximal positive invariant set is…
The efficient management of large-scale queueing networks is critical for a variety of sectors, including healthcare, logistics, and customer service, where system performance has profound implications for operational effectiveness and cost…
Classical simulations of time-dependent quantum systems are widely used in quantum control research. In particular, these simulations are commonly used to host iterative optimal control algorithms. This is convenient for algorithms that are…
In this paper, we analyze how well a machine can solve a general problem in queueing theory. To answer this question, we use a deep learning model to predict the stationary queue-length distribution of an $M/G/1$ queue (Poisson arrivals,…
A new approach to the steady state detection in the uniformization method of solving continuous time Markov chains is introduced. The method is particularly useful in solving inhomogenous CTMC's in multiple steps, where the desired error…
We develop an efficient method to calculate probabilities of large deviations from the typical behavior (rare events) in reaction--diffusion systems. The method is based on a semiclassical treatment of underlying "quantum" Hamiltonian,…
We investigate the steady-state diffusion-approximation error for continuous-time queueing systems with generally distributed primitives. Across four canonical systems -- the $G/G/1$ and $G/M/\infty$ queues, the join-the-shortest-queue…
Inexact methods for model predictive control (MPC), such as real-time iterative schemes or time-distributed optimization, alleviate the computational burden of exact MPC by providing suboptimal solutions. While the asymptotic stability of…