Stochastic Timed Automata
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 $\Phi$, we want to decid...
Main Authors: | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Groesser, Marcin Jurdzinski |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2014-12-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1092/pdf |
Similar Items
-
Model Checking Probabilistic Timed Automata with One or Two Clocks
by: Marcin Jurdzinski, et al.
Published: (2008-09-01) -
Model Checking One-clock Priced Timed Automata
by: Patricia Bouyer, et al.
Published: (2008-06-01) -
Reconfiguration and Message Losses in Parameterized Broadcast Networks
by: Nathalie Bertrand, et al.
Published: (2021-03-01) -
Language Preservation Problems in Parametric Timed Automata
by: Étienne André, et al.
Published: (2020-01-01) -
O-Minimal Hybrid Reachability Games
by: Patricia Bouyer, et al.
Published: (2010-01-01)