Journal article
Local abstraction refinement for probabilistic timed programs
- 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...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Theoretical Computer Science Journal website
- Volume:
- 538
- Pages:
- 37-53
- Publication date:
- 2013-08-01
- DOI:
- ISSN:
-
0304-3975
Item Description
- Keywords:
- Pubs id:
-
pubs:518308
- UUID:
-
uuid:e821293c-2794-4fb9-9dbd-448ddcadd558
- Local pid:
- pubs:518308
- Source identifiers:
-
518308
- Deposit date:
- 2020-01-12
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2013
- Notes:
- © 2013 Elsevier B.V. All rights reserved. This is an open access article distributed under the terms of the Creative Commons Attribution Licence
- Licence:
- CC Attribution (CC BY)
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record