Stochastic Games for Verification of Probabilistic Timed Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Stochastic Games for Verification of Probabilistic Timed Automata

Marta Kwiatkowska
  • Function : Author
  • PersonId : 861066


Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic timed automata, forwards reachability is the analysis method of choice, since it can be implemented extremely efficiently. However, for PTAs, such techniques are only able to compute upper bounds on maximum reachability probabilities. In this paper, we propose a new approach to the analysis of PTAs using abstraction and stochastic games. We show how efficient forwards reachability techniques can be extended to yield both lower and upper bounds on maximum (and minimum) reachability probabilities. We also present abstraction-refinement techniques that are guaranteed to improve the precision of these probability bounds, providing a fully automatic method for computing the exact values. We have implemented these techniques and applied them to a set of large case studies. We show that, in comparison to alternative approaches to verifying PTAs, such as backwards reachability and digital clocks, our techniques exhibit superior performance and scalability.
Fichier principal
Vignette du fichier
formats09.pdf (198.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00457923 , version 1 (18-02-2010)



Marta Kwiatkowska, Gethin Norman, David Parker. Stochastic Games for Verification of Probabilistic Timed Automata. 7th International Conference on Formal Modeling and Analysis of Timed Systems : FORMATS 2009, Sep 2009, Budapest, Hungary. pp.212-217, ⟨10.1007/978-3-642-04368-0_17⟩. ⟨inria-00457923⟩


67 View
195 Download



Gmail Facebook X LinkedIn More