Draeger, K., Kwiatkowska, M., Parker, D. et al. (1 more author) (2014) Local abstraction refinement for probabilistic timed programs. Theoretical Computer Science, 538. pp. 37-53. ISSN 0304-3975
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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2013 Elsevier. Open Access funded by Engineering and Physical Sciences Research Council Under a Creative Commons license (https://creativecommons.org/licenses/by/3.0/). |
Keywords: | Probabilistic verification; Abstraction refinement |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Automatic Control and Systems Engineering (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 27 Sep 2017 13:18 |
Last Modified: | 27 Sep 2017 13:18 |
Published Version: | https://doi.org/10.1016/j.tcs.2013.07.013 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.tcs.2013.07.013 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:121334 |