Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the prob- ability of reaching some set of states is either maximised or minimised. Our rst algorithm, based on forward exploration of the symbolic states, can only guarantee para...
| Main Authors: | , |
|---|---|
| Format: | Report |
| Published: |
DCS
2014
|