Stochastic Approximation of Global Reachability Probabilities of Markov Population Models
Complex computer systems, from peer-to-peer networks to the spreading of computer virus epidemics, can often be described as Markovian models of large populations of interacting agents. Many properties of such systems can be rephrased as the computation of time bounded reachability probabilities. However, large population models suffer severely from state space explosion, hence a direct computation of these probabilities is often unfeasible. In this paper we present some results in estimating these probabilities using ideas borrowed from Fluid and Central Limit approximations. We consider also an empirical improvement of the basic method leveraging higher order stochastic approximations. Results are illustrated on a peer-to-peer example.
KeywordsStochastic model checking reachability hitting times fluid approximation central limit approximation linear noise approximation
Unable to display preview. Download preview PDF.
- 4.Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press (2008)Google Scholar
- 5.Bortolussi, L.: Hybrid behaviour of Markov population models. CoRR, abs/1211.1643 (2012)Google Scholar
- 10.Bujorianu, L.M.: Stochastic Reachability Analysis of Hybrid Systems. In: Communications and Control Engineering. Springer (2012)Google Scholar
- 11.Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence. Wiley (2005)Google Scholar
- 12.Fricker, C., Gast, N.: Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity. EURO Journal on Transportation and Logistics, 1–31 (2012)Google Scholar
- 13.Grima, R.: An effective rate equation approach to reaction kinetics in small volumes: Theory and application to biochemical reactions in nonequilibrium steady-state conditions. The Journal of Chemical Physics 133(3), 035101 (2010)Google Scholar
- 14.Hayden, R.A.: Mean field for performance models with deterministically-timed transitions. In: Proceedings of QEST 2012, pp. 63–73 (2012)Google Scholar
- 17.Katoen, J.P., Khattri, M., Zapreevt, I.S.: A Markov reward model checker. In: Proceedings of QEST 2005, pp. 243–244 (2005)Google Scholar
- 19.Norris, J.R.: Markov Chains. Cambridge University Press (1997)Google Scholar
- 20.Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: Proceedings of ACM SIGCOMM 2004, pp. 367–378 (2004)Google Scholar
- 21.Stamatiou, Y.C., Spirakis, P.G., Komninos, T., Vavitsas, G.: Computer Network Epidemics: Models and Techniques for Invasion and Defense. CRC Press (2012)Google Scholar
- 22.Van Kampen, N.G.: Stochastic Processes in Physics and Chemistry. Elsevier (1992)Google Scholar