A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
[chapter]
2014
Lecture Notes in Computer Science
We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised. Our first algorithm, based on forward exploration of the symbolic states, can only guarantee parameter values that correspond to upper (resp. lower) bounds on maximum (resp. minimum) reachability probability. To ensure precise reachability probabilities, we adapt the game-based abstraction
doi:10.1007/978-3-319-11439-2_14
fatcat:jgffahmybjaxpognc2j2fzqgiu