Elsevier

Theoretical Computer Science

Volume 538, 12 June 2014, Pages 37-53
Theoretical Computer Science

Local abstraction refinement for probabilistic timed programs

https://doi.org/10.1016/j.tcs.2013.07.013Get rights and content
Under a Creative Commons license
open access

Abstract

We consider models of programs that incorporate probability, dense real-time and data. We present a new abstraction refinement method for computing minimum and maximum reachability probabilities for such models. Our approach uses strictly local refinement steps to reduce both the size of abstractions generated and the complexity of operations needed, in comparison to previous approaches of this kind. We implement the techniques and evaluate them on a selection of large case studies, including some infinite-state probabilistic real-time models, demonstrating improvements over existing tools in several cases.

Keywords

Probabilistic verification
Abstraction refinement

Cited by (0)