Skip to Main content Skip to Navigation
Journal articles

Stochastic timed automata

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download
Contributor : Nathalie Bertrand Connect in order to contact the contributor
Submitted on : Monday, January 12, 2015 - 4:04:37 PM
Last modification on : Saturday, June 25, 2022 - 9:09:19 PM
Long-term archiving on: : Friday, September 11, 2015 - 6:36:00 AM


Files produced by the author(s)



Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, et al.. Stochastic timed automata. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, 10 (4), ⟨10.2168/LMCS-10(4:6)2014⟩. ⟨hal-01102368⟩



Record views


Files downloads