Stochastic Approximation of Global Reachability Probabilities of Markov Population Models

  title={Stochastic Approximation of Global Reachability Probabilities of Markov Population Models},
  author={Luca Bortolussi and Roberta Lanciani},
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… 

Model Checking Markov Population Models by Stochastic Approximations

Fluid Approximation–based Analysis for Mode-switching Population Dynamics

This article studies the case where changes in population dynamics are induced by information about the environment being communicated between components of the population via broadcast communication, and proposes heuristic constructions for extracting the mean behaviour from the resulting approximations without the need to simulate individual trajectories.

Fluid Model Checking of Timed Properties

The problem of verifying timed properties of Markovian models of large populations of interacting agents, modelled as finite state automata, is addressed, and a set of Delay Differential Equations (DDE) is derived, whose numerical solution provides a fast and accurate estimate of the satisfaction probability.

Bounding Mean First Passage Times in Population Continuous-Time Markov Chains

A technique is proposed that extends recently developed methods using semi-definite programming to determine bounds on mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents.

Stochastic Approximations in Model Checking: A New Scalable Approach to Collective Systems Verification

A new scalable and effective technique to validate the performance of collective systems, based on Stochastic Approximations of the dynamics of the model, is considered and some interesting contributions are defined leading the investigation in two major directions.

Approximation of Probabilistic Reachability for Chemical Reaction Networks Using the Linear Noise Approximation

An algorithm for approximate computation of time-bounded reachability probabilities on the resulting DTMC is formulated and it is demonstrated on two case studies that it permits fast and scalable computation of reachability properties with controlled accuracy.

Central Limit Model Checking

A continuous-space approximation of the CTMC in terms of a Gaussian process based on the Central Limit Approximation, whose solution requires solving a number of differential equations that is quadratic in the number of species and independent of the population size is employed.

Probabilistic Model Checking for Continuous Time Markov Chains via Sequential Bayesian Inference

This work shows how model checking of time-bounded path properties can be recast exactly as a Bayesian inference problem, and shows that this method achieves both high accuracy and significant computational gains compared to statistical model checking.

Analysis of Markov Jump Processes under Terminal Constraints

This work proposes a solution to this bridging problem for the widely used class of population-structured Markov jump processes based on a state-space lumping scheme that aggregates states in a grid structure and demonstrates the method’s applicability to a wide range of problems such as Bayesian inference and the analysis of rare events.

Location Aggregation of Spatial Population CTMC Models

This paper presents a heuristic approach to aggregating spatial locations, which is designed to preserve the dynamical behaviour of the model whilst reducing the computational cost of analysis.



Model Checking Markov Population Models by Central Limit Approximation

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, is investigated.

Hybrid behaviour of Markov population models

Fluid computation of passage-time distributions in large Markov models

Fluid Model Checking

A potential use of fluid approximation techniques in the context of stochastic model checking of CSL formulae to approximate the behaviour of a single agent with a time-inhomogeneous CTMC which depends on the environment and on the other agents only through the solution of the fluid differential equation.

Continuous approximation of collective system behaviour: A tutorial

Mean Field for Performance Models with Deterministically-Timed Transitions

  • R. Hayden
  • Computer Science, Mathematics
    2012 Ninth International Conference on Quantitative Evaluation of Systems
  • 2012
A new low-level formalism for specifying massively-parallel models with generally-timed transitions, the population generalised semi-Markov process (PGSMP), is introduced and it is shown how systems of coupled delay differential equations (DDEs) which approximate transient component counts may be mechanistically derived from such models.

Stochastic Reachability Analysis of Hybrid Systems

Stochastic reachability analysis characterizes a highly interdisciplinary area of research and is consequently of significant interest to academic researchers and graduate students from a variety of backgrounds in control engineering, applied mathematics and computer science.

PALOMA: A Process Algebra for Located Markovian Agents

We present a novel stochastic process algebra that allows the expression of models representing systems comprised of populations of agents distributed over space, where the relative positions of

Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation

In this chapter, we will describe, in a tutorial style, recent work on the use of fluid approximation techniques in the context of stochastic model checking. We will discuss the theoretical

Model Checking Continuous-Time Markov Chains by Transient Analysis

The main result of this paper is that model checking probabilistic timing properties can be reduced to the problem of computing transient state probabilities for CTMCs, and a variant of ordinary lumping equivalence, a well-known notion for aggregating CT MCs, preserves the validity of all CSL-formulas.