3 results
Patricia Bouyer ; Kim G. Larsen ; Nicolas Markey.
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical temporal logics with cost constraints on modalities. […]
Published on June 20, 2008
Nathalie Bertrand ; Patricia Bouyer ; Thomas Brihaye ; Quentin Menet ; Christel Baier ; Marcus Groesser ; Marcin Jurdzinski.
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 […]
Published on December 9, 2014
Patricia Bouyer ; Antonio Casares ; Mickael Randour ; Pierre Vandenhove.
In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we characterize objectives recognizable by deterministic B\"uchi automata (a subclass of omega-regular objectives) that are […]
Published on August 29, 2024