Model Checking CSL for Markov Population Models

David Spieler
(Saarland University)
Ernst Moritz Hahn
(State Key Laboratory of Computer Science)
Lijun Zhang
(State Key Laboratory of Computer Science)

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, and various others. Because of the infinite state space, available analysis techniques only apply to a very restricted subset of CSL properties. We present a full algorithm for model checking CSL for MPMs, and provide experimental evidence showing that our method is effective.

In Nathalie Bertrand and Luca Bortolussi: Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2014), Grenoble, France, 12-13 April 2014, Electronic Proceedings in Theoretical Computer Science 154, pp. 93–107.
Published: 6th June 2014.

ArXived at: http://dx.doi.org/10.4204/EPTCS.154.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org