Computing Cumulative Rewards Using Fast Adaptive Uniformisation

Frits Dannenberg, Ernst Moritz Hahn, Marta Z. Kwiatkowska

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

The computation of transient probabilities for continuous-time Markov chains often employs uniformisation, also known as the Jensen’s method. The fast adaptive uniformisation method introduced by Mateescu approximates the probability by neglecting insignificant states, and has proven to be effective for quantitative analysis of stochastic models arising in chemical and biological applications. However, this method has only been formulated for the analysis of properties at a given point of time t. In this paper, we extend fast adaptive uniformisation to handle expected reward properties which reason about the model behaviour until time t, for example, the expected number of chemical reactions that have occurred until t. To show the feasibility of the approach, we integrate the method into the probabilistic model checker PRISM and apply it to a range of biological models, demonstrating superior performance compared to existing techniques.
Original languageEnglish
Title of host publicationComputational Methods in Systems Biology - 11th International Conference, CMSB 2013, Klosterneuburg, Austria, September 22-24, 2013. Proceedings
Pages33-49
Number of pages17
DOIs
Publication statusPublished - 2013
Externally publishedYes

Fingerprint Dive into the research topics of 'Computing Cumulative Rewards Using Fast Adaptive Uniformisation'. Together they form a unique fingerprint.

  • Cite this

    Dannenberg, F., Hahn, E. M., & Kwiatkowska, M. Z. (2013). Computing Cumulative Rewards Using Fast Adaptive Uniformisation. In Computational Methods in Systems Biology - 11th International Conference, CMSB 2013, Klosterneuburg, Austria, September 22-24, 2013. Proceedings (pp. 33-49) https://doi.org/10.1007/978-3-642-40708-6_4