Abstract
A fundamental issue in the analysis of emergency call centers is to estimate the time needed to return to a congestion-free regime after an unusual event with a massive arrival of calls. Call centers can generally be represented by timed Petri nets with a hierarchical structure, in which several layers describe the successive steps of treatments of calls. We study a continuous approximation of the Petri net dynamics (with infinitesimal tokens). Then, we show that a counter function, measuring the deviation to the stationary regime, coincides with the value function of a semi-Markov decision problem. We establish a finite time convergence result, exploiting the hierarchical structure of the Petri net. We obtain an explicit bound for the transience time, as a function of the initial marking and sojourn times. This is based on methods from the theory of stochastic shortest paths and non-linear Perron–Frobenius theory. We illustrate the bound on a case study of a medical emergency call center.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Allamigeon, X., Bœuf, V., Gaubert, S.: Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 10–26. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22975-1_2
Allamigeon, X., Boyet, M., Gaubert, S.: Piecewise affine dynamical models of timed Petri nets-application to emergency call centers. Fundam. Inform. 183(3–4), 169–201 (2021). Extended version of an article published in the International Conference on Applications and Theory of Petri Nets and Concurrency, 2020, Springer LNCS
Allamigeon, X., Boyet, M., Gaubert, S.: Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach. Extended version of the present article. arXiv:2202.02752 (2022)
Akian, M., Gaubert, S., Nussbaum, R.: A Collatz-Wielandt characterization of the spectral radius of order-preserving homogeneous maps on cones. arXiv:1112.5968 (2011)
Akian, M., Gaubert, S., Qu, Z., Saadi, O.: Solving ergodic Markov decision processes and perfect information zero-sum stochastic games by variance reduced deflated value iteration. In: 2019 IEEE 58th Conference on Decision and Control (CDC), pp. 5963–5970. IEEE (2019)
Baccelli, F., Cohen, G., Olsder, G.-J., Quadrat, J.-P.: Synchronization and Linearity. Wiley, Hoboken (1992)
Bouillard, A., Gaujal, B.: Coupling time of a (max, plus) matrix. In: Proceedings of the Workshop on Max-Plus Algebras, a satellite event of the first IFAC Symposium on System, Structure and Control (Praha, 2001). Elsevier (2001)
Bonet, B.: On the speed of convergence of value iteration on stochastic shortest-path problems. Math. Oper. Res. 32(2), 365–373 (2007)
Boyet, M.:. Piecewise affine dynamical systems applied to the performance evaluation of emergency call centers. Ph.D. manuscript, Ecole polytechnique (2022)
Boeuf, V., Robert, Ph.: A stochastic analysis of a network with two levels of service. Queueing Syst. 92(3-4), 30 (2019)
Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Math. Oper. Res. 16(3), 580–595 (1991)
Charron-Bost, B., Függer, M., Nowak, T.: Transience bounds for distributed algorithms. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 77–90. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40229-6_6
Cohen, G., Gaubert, S., Quadrat, J.P.: Asymptotic throughput of continuous timed Petri nets. In: Proceedings of the 34th Conference on Decision and Control, New Orleans, December 1995
Cohen, G., Gaubert, S., Quadrat, J.P.: Algebraic system analysis of timed Petri nets. In: Gunawardena, J. (ed.) Idempotency, Publications of the Isaac Newton Institute, pp. 145–170. Cambridge University Press, Cambridge (1998)
Denardo, E.V., Fox, B.L.: Multichain Markov renewal programs. SIAM J. Appl. Math. 16, 468–487 (1968)
Feinberg, E.A.: Constrained semi-Markov decision processes with average rewards. Z. Oper. Res. 39(3), 257–288 (1994)
Gaujal, B., Giua, A.: Optimal stationary behavior for a class of timed continuous Petri nets. Automatica 40(9), 1505–1516 (2004)
Hartmann, M., Arguelles, C.: Transience bounds for long walks. Math. Oper. Res. 24(2), 414–439 (1999)
Huang, Y., Guo, X.: Finite horizon semi-Markov decision processes with application to maintenance systems. Eur. J. Oper. Res. 212(1), 131–140 (2011)
Heidergott, B., Olsder, G.-J., van der Woude, J.: Max-Plus at Work. Princeton University Press, Princeton (2005)
Merlet, G., Nowak, T., Sergeev, S.: Weak CSR expansions and transience bounds in max-plus algebra. Linear Algebra Appl. 461, 163–199 (2014)
Merlet, G., Nowak, Th., Sergeev, S.: On the tightness of bounds for transients of weak CSR expansions and periodicity transients of critical rows and columns of tropical matrix powers. Linear Multilinear Algebra 1–31 (2021)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (2014)
Ross, S.M.: Average cost semi-Markov decision processes. J. Appl. Probab. 7(3), 649–656 (1970)
Schweitzer, P.J., Federgruen, A.: The functional equations of undiscounted Markov renewal programming. Math. Oper. Res. 3(4), 308–321 (1978)
Schweitzer, P.J., Federgruen, A.: The asymptotic behavior of undiscounted value iteration in Markov decision problems. Math. Oper. Res. 2, 360–381 (1978)
Schweitzer, P.J., Federgruen, A.: Geometric convergence of value-iteration in multichain Markov decision problems. Adv. Appl. Prob. 11, 188–217 (1979)
Sergeev, S., Schneider, H.: CSR expansions of matrix powers in max algebra. Trans. AMS 364(11), 5969–5994 (2012)
Yushkevich, A.A.: On semi-Markov controlled models with an average reward criterion. Theory Probab. Appl. 26(4), 796–803 (1982)
Acknowledgements
The second author was partially supported by the PhD fellowship program of DGA. We also acknowledge the support of IHEMI, and of the IROE-PRMO program of Fondation Mathématique Jacques Hadamard, sponsored by EDF. The modelling of the medical emergency call center described in Sect. 2 was carried out as part of a collaboration with the SAMU of AP-HP. We thank especially, Pr. P. Carli, Dr. E. Chanzy, Dr. E. Lecarpentier, Dr. Ch. Leroy, Dr. Th. Loeb, Dr. J.-S. Marx, Dr. N. Poirot and Dr. C. Telion for making this work possible, for their support and for insightful comments. We also thank all the other personals of the SAMU, in particular Dr. J. Boutet, J.-M. Gourgues, I. Lhomme, F. Linval and Th. Pérennou. This work also strongly benefited from the experience acquired, since 2014, on the analysis of the new platform “PFAU” (answering to the emergency numbers 17, 18 and 112), developed by PP. We thank especially Lcl S. Raclot and R. Reboul.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Allamigeon, X., Boyet, M., Gaubert, S. (2022). Computing Transience Bounds of Emergency Call Centers: A Hierarchical Timed Petri Net Approach. In: Bernardinello, L., Petrucci, L. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2022. Lecture Notes in Computer Science, vol 13288. Springer, Cham. https://doi.org/10.1007/978-3-031-06653-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-06653-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-06652-8
Online ISBN: 978-3-031-06653-5
eBook Packages: Computer ScienceComputer Science (R0)