A logic for model-checking mean-field models

Recently the mean-field method has been adopted for analysing systems consisting of a large number of interacting objects in computer science, biology, chemistry, etc. It allows for a quick and accurate analysis of such systems, while avoiding the state-space explosion problem. So far, the method has primarily been used for performance evaluation. In this paper, we use the mean-field method for model-checking. We define and motivate a logic MF-CSL for describing properties of systems composed of many identical interacting objects. The proposed logic allows describing both properties of the overall system and of a random individual object. Algorithms to check the satisfaction relation for all MF-CSL operators are proposed. Furthermore, we explain how the set of all time instances that fulfill a given MF-CSL formula for a certain distribution of objects can be computed.

[1]  Boudewijn R. Haverkort,et al.  Automating the Mean-Field Method for Large Dynamic Gossip Networks , 2010, QEST.

[2]  Marco Gribaudo,et al.  Model Checking Functional and Performability Properties of Stochastic Fluid Models , 2005, AVoCS.

[3]  HalbwachsNicolas,et al.  Verification of Real-Time Systems using Linear Relation Analysis , 1997 .

[4]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[5]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[6]  Jean-Yves Le Boudec,et al.  The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points , 2010, Networks Heterog. Media.

[7]  Jean-Yves Le Boudec,et al.  A Generic Mean Field Convergence Result for Systems of Interacting Objects , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

[8]  Boudewijn R. Haverkort,et al.  Mean-Field Analysis for the Evaluation of Gossip Protocols , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[9]  Miklós Telek,et al.  Analysis of Large Scale Interacting Systems by Mean Field Method , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[10]  T. Kurtz.  Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

[11]  Nicolas Halbwachs,et al.  Verification of Real-Time Systems using Linear Relation Analysis , 1997, Formal Methods Syst. Des..

[12]  R. W. R. Darling.  Fluid Limits of Pure Jump Markov Processes: a Practical Guide , 2002 .

[13]  William H. Sanders,et al.  Modeling Peer-to-Peer Botnets , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[14]  J. Boudec,et al.  A Generic Mean Field Convergence Result for Systems of Interacting Objects , 2007 .

[15]  Luca Bortolussi,et al.  Fluid Model Checking , 2012, CONCUR.

[16]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[17]  Joost-Pieter Katoen,et al.  Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains , 2008, FORMATS.

[18]  Boudewijn R. Haverkort,et al.  Mean-field framework for performance evaluation of push-pull gossip protocols , 2011, Perform. Evaluation.

[19]  Joost-Pieter Katoen,et al.  LTL Model Checking of Time-Inhomogeneous Markov Chains , 2009, ATVA.

[20]  Boudewijn R. Haverkort,et al.  Comparison of the Mean-Field Approach and Simulation in a Peer-to-Peer Botnet Case Study , 2011, EPEW.

[21]  Pierre Wolper,et al.  Verifying Systems with Infinite but Regular State Spaces , 1998, CAV.

[22]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..