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

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

Stéphane Gaubert, Xavier Allamigeon, Marin Boyet

Publication date: 19 August 2022

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

zbMATH Keywords

semi-Markov decision processes; timed Petri nets; stochastic shortest path; continuous Petri nets; emergency call centers; stationary regimes; transience bound

Mathematics Subject Classification ID

90C40: Markov and semi-Markov decision processes

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)