Stochastic Timed Automata

Nathalie BertrandNathalie Bertrand, Patricia BouyerPatricia Bouyer, Thomas BrihayeThomas Brihaye, Quentin MenetQuentin Menet, Christel BaierChristel Baier, Marcus GrößerMarcus Größer, Marcin JurdzinskiMarcin Jurdzinski

DOI Link

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski
Stochastic Timed Automata
Logical Methods in Computer Science (LMCS), 10(4):1--73, 2014

Details
Bibtex

KurzfassungAbstract
A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a stochastic timed automaton A and a property Φ, we want to decide whether A satisfies Φ with probability 1. In this paper, we identify several classes of automata and of properties for which this can be decided. The proof relies on the construction of a finite abstraction, called the thick graph, that we interpret as a finite Markov chain, and for which we can decide the almost-sure model-checking problem. Correctness of the abstraction holds when automata are almost-surely fair, which we show, is the case for two large classes of systems, single- clock automata and so-called weak-reactive automata. Techniques employed in this article gather tools from real-time verification and probabilistic verification, as well as topological games played on timed automata.
Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science

@article{BBBMBGJ2014,
  author  = {Nathalie Bertrand and Patricia Bouyer and Thomas Brihaye and
             Quentin Menet and Christel Baier and Marcus Gr{\"{o}}{\ss}er and
             Marcin Jurdzinski},
  title   = {Stochastic Timed Automata},
  journal = {Logical Methods in Computer Science (LMCS)},
  volume  = {10},
  number  = {4},
  year    = {2014},
  pages   = {1--73},
  doi     = {10.2168/LMCS-10(4:6)2014}
}