Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

Abstract

The verification of probabilistic timed automata involves finding schedulers that optimise their nondeterministic choices with respect to the probability of a property. In practice, approaches based on model checking fail due to state-space explosion, while simulation-based techniques like statistical model checking are not applicable due to the nondeterminism. We present a new lightweight on-the-fly algorithm to find near-optimal schedulers for probabilistic timed automata. We make use of the classical region and zone abstractions from timed automata model checking, coupled with a recently developed smart sampling technique for statistical verification of Markov decision processes. Our algorithm provides estimates for both maximum and minimum probabilities. We compare our new approach with alternative techniques, first using tractable examples from the literature, then motivate its scalability using case studies that are intractable to numerical model checking and challenging for existing statistical techniques.
Fichier principal
Vignette du fichier
paper.pdf (188.07 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01387362 , version 1 (25-10-2016)
hal-01387362 , version 2 (25-10-2016)

Identifiers

  • HAL Id : hal-01387362 , version 2

Cite

Pedro R. d'Argenio, Arnd Hartmanns, Axel Legay, Sean Sedwards. Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata. Integrated Formal Methods, Jun 2016, Reykjavik, Iceland. pp.99-114. ⟨hal-01387362v2⟩
446 View
164 Download

Share

Gmail Mastodon Facebook X LinkedIn More