Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)
Model Checking Markov Chains with Actions and State Labels
IEEE Transactions on Software Engineering
Probabilistic model checking of complex biological pathways
Theoretical Computer Science
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Model Checking Timed and Stochastic Properties with CSL^{TA}
IEEE Transactions on Software Engineering
A Bayesian Approach to Model Checking Biological Systems
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back
Transactions on Computational Systems Biology XI
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Fluid computation of passage-time distributions in large Markov models
Theoretical Computer Science
Scalable Differential Analysis of Process Algebra Models
IEEE Transactions on Software Engineering
Comparison of the mean-field approach and simulation in a peer-to-peer botnet case study
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Continuous approximation of collective system behaviour: A tutorial
Performance Evaluation
Performance Specification and Evaluation with Unified Stochastic Probes and Fluid Analysis
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
In this paper we investigate the use of Central Limit Approximation of Continuous Time Markov Chains to verify collective properties of large population models, describing the interaction of many similar individual agents. More precisely, we specify properties in terms of individual agents by means of deterministic timed automata with a single global clock (which cannot be reset), and then use the Central Limit Approximation to estimate the probability that a given fraction of agents satisfies the local specification.