Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach

DOI10.1007/978-3-031-06653-5_5zbMath1499.68215arXiv2202.02752OpenAlexW4285293964MaRDI QIDQ2165235

Marin Boyet, Stéphane Gaubert, Xavier Allamigeon

Publication date: 19 August 2022

Full work available at URL: https://arxiv.org/abs/2202.02752

zbMATH Keywords

semi-Markov decision processestimed Petri netsstochastic shortest pathcontinuous Petri netsemergency call centersstationary regimestransience bound

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak CSR expansions and transience bounds in max-plus algebra
• Finite horizon semi-Markov decision processes with application to maintenance systems
• Optimal stationary behavior for a class of timed continuous Petri nets
• A stochastic analysis of a network with two levels of service
• Transience Bounds for Long Walks
• Transience Bounds for Distributed Algorithms
• CSR expansions of matrix powers in max algebra
• Performance Evaluation of an Emergency Call Center: Tropical Polynomial Systems Applied to Timed Petri Nets
• On Semi-Markov Controlled Models with an Average Reward Criterion
• An Analysis of Stochastic Shortest Path Problems
• The Functional Equations of Undiscounted Markov Renewal Programming
• Geometric convergence of value-iteration in multichain Markov decision problems
• The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems
• Constrained Semi-Markov decision processes with average rewards
• Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers*
• On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems
• Multichain Markov Renewal Programs
• Average cost semi-markov decision processes

This page was built for publication: Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach