Model Checking CSL for Markov Population Models

  title={Model Checking CSL for Markov Population Models},
  author={David Spieler and Ernst Moritz Hahn and Lijun Zhang},
Markov population models (MPMs) are a widely used modelling formalism in the area of computational biology and related areas. The semantics of a MPM is an infinite-state continuous-time Markov chain. In this paper, we use the established continuous stochastic logic (CSL) to express properties of Markov population models. This allows us to express important measures of biological systems, such as probabilistic reachability, survivability, oscillations, switching times between attractor regions… 

Tables from this paper

Numerical analysis of long-run properties for Markov population models

This doctoral thesis presents a highly efficient method to compute a finite state space truncation entailing most of the steady state probability mass and is combined with truncation based reachability analysis and aggregation to derive state wise steady state bounds.

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.

Trend-Based Analysis of a Population Model of the AKAP Scaffold Protein

This work formalises a continuous-time Markov chain with multi-dimensional discrete state space model of the AKAP scaffold protein as a crosstalk mediator between two biochemical signalling pathways and shows how stochastic trends can be implemented in a guarded-command style specification language for transition systems.

Computing Cumulative Rewards Using Fast Adaptive Uniformization

This article extends fast adaptive uniformization to handle expected reward properties that reason about the model behavior until time t, and integrates the method into the probabilistic model checker PRISM and applies it to a range of biological models.

Quantitative Aspects of Programming Languages and Systems over the past $2^4$ years and beyond

The aim of this survey is to revisit such achievements and results from the standpoint of QAPL and its community.

Quantitative Evaluation of Systems: 17th International Conference, QEST 2020, Vienna, Austria, August 31 – September 3, 2020, Proceedings

Two reliability analysis studies from two large, distributed systems are presented: one that looks into GPGPU error prediction at the Titan, a large scale highperformance-computing system at ORNL, and one that analyzes the failure characteristics of solid state drives at a Google data center and hard disk drives at the Backblaze data center.



Time-bounded model checking of infinite-state continuous-time Markov chains

This paper presents a method that only explores the infinite (or prohibitively large) model up to a finite depth, with the depth bound being computed on-the-fly.

INFAMY: An Infinite-State Markov Model Checker

INFAMY is a model checker for arbitrarily structured infinite-state CTMCs, which checks probabilistic timing properties expressible in continuous stochastic logic (CSL).

CSL model checking algorithms for QBDs

Model-Checking Algorithms for Continuous-Time Markov Chains

The problem of model-checking time-bounded until properties can be reduced to the problem of computing transient state probabilities for CTMCs and a variant of lumping equivalence (bisimulation) preserves the validity of all formulas in the logic.

Three-Valued Abstraction for Stochastic Systems

This thesis is concerned with abstraction, that is, with the reduction of available information in the system’s model, and the question of what properties are preserved when applying abstraction, and is focusing on the more intricate quantitative properties of probabilistic timed systems that can be expressed in PCTL and CSL.

Analysing Biochemical Oscillation through Probabilistic Model Checking

Three-Valued Abstraction for Continuous-Time Markov Chains

It is shown that this provides a conservative abstraction for both true and false for a three-valued semantics of the branching-time logic CSL (Continuous Stochastic Logic).

Model-checking continuous-time Markov chains

The major result is that the verification problem is decidable; this is shown using results in algebraic and transcendental number theory.

Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons

Bounding the equilibrium distribution of Markov population models

A bounding technique for the equilibrium probability distribution of continuous-time Markov chains with population structure and infinite state space is proposed and a refinement scheme based on stochastic complementation is applied.