Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions [chapter]

Aleksandra Jovanović, Marta Kwiatkowska
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
more » ... ment method. In the parametric setting, our method is able to determine all the possible maximum (or minimum) reachability probabilities that arise for different values of timing parameters, and yields optimal valuations represented as a set of symbolic constraints between parameters.
doi:10.1007/978-3-319-11439-2_14 fatcat:jgffahmybjaxpognc2j2fzqgiu