Model Checking Algorithms for CTMDPs

Peter Buchholz; Ernst Moritz Hahn; Holger Hermanns; Lijun Zhang

doi:10.1007/978-3-642-22110-1_19

Model Checking Algorithms for CTMDPs

Peter Buchholz, Ernst Moritz Hahn, Holger Hermanns, Lijun Zhang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

30 Citations (Scopus)

Abstract

Continuous Stochastic Logic (CSL) can be interpreted over continuous-time Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategies to prove or disprove a formula. The paper presents a conservative extension of CSL over CTMDPs—with rewards—and exploits established results for CTMDPs for model checking CSL. A new numerical approach based on uniformization is devised to compute time bounded reachability results for time dependent control strategies. Experimental evidence is given showing the efficiency of the approach.

Original language	English
Title of host publication	Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings
Pages	225-242
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-22110-1_19
Publication status	Published - 2011
Externally published	Yes

Access to Document

10.1007/978-3-642-22110-1_19

https://doi.org/10.1007/978-3-642-22110-1_19

Cite this

@inproceedings{3b2643ef17c344349d256ffb98ab927e,

title = "Model Checking Algorithms for CTMDPs",

abstract = "Continuous Stochastic Logic (CSL) can be interpreted over continuous-time Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategies to prove or disprove a formula. The paper presents a conservative extension of CSL over CTMDPs—with rewards—and exploits established results for CTMDPs for model checking CSL. A new numerical approach based on uniformization is devised to compute time bounded reachability results for time dependent control strategies. Experimental evidence is given showing the efficiency of the approach.",

author = "Peter Buchholz and Hahn, {Ernst Moritz} and Holger Hermanns and Lijun Zhang",

year = "2011",

doi = "10.1007/978-3-642-22110-1_19",

language = "English",

pages = "225--242",

booktitle = "Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings",

}

TY - GEN

T1 - Model Checking Algorithms for CTMDPs

AU - Buchholz, Peter

AU - Hahn, Ernst Moritz

AU - Hermanns, Holger

AU - Zhang, Lijun

PY - 2011

Y1 - 2011

N2 - Continuous Stochastic Logic (CSL) can be interpreted over continuous-time Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategies to prove or disprove a formula. The paper presents a conservative extension of CSL over CTMDPs—with rewards—and exploits established results for CTMDPs for model checking CSL. A new numerical approach based on uniformization is devised to compute time bounded reachability results for time dependent control strategies. Experimental evidence is given showing the efficiency of the approach.

AB - Continuous Stochastic Logic (CSL) can be interpreted over continuous-time Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategies to prove or disprove a formula. The paper presents a conservative extension of CSL over CTMDPs—with rewards—and exploits established results for CTMDPs for model checking CSL. A new numerical approach based on uniformization is devised to compute time bounded reachability results for time dependent control strategies. Experimental evidence is given showing the efficiency of the approach.

U2 - 10.1007/978-3-642-22110-1_19

DO - 10.1007/978-3-642-22110-1_19

M3 - Conference contribution

SP - 225

EP - 242

BT - Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings

ER -

Model Checking Algorithms for CTMDPs

Abstract

Access to Document

Fingerprint

Cite this