Local abstraction refinement for probabilistic timed programs
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 abstraction...
| Autores principales: | , , , |
|---|---|
| Formato: | Journal article |
| Publicado: |
Elsevier
2013
|