20 citations · 21 across the 4 of their papers we have counts for
4 papers
Synthesising Succinct Strategies in Safety Games
Gilles Geeraerts, Joël Goossens, Amélie Stainer
Finite turn-based safety games have been used for very different problems such as the synthesis of linear temporal logic (LTL), the synthesis of schedulers for computer systems run…
Emptiness and Universality Problems in Timed Automata with Positive Frequency
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye +1
The languages of infinite timed words accepted by timed automata are traditionally defined using Buchi-like conditions. These acceptance conditions focus on the set of locations vi…
Reachability of Communicating Timed Processes
Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer +1
We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over…
Off-line test selection with test purposes for non-deterministic timed automata
Nathalie Bertrand, Thierry Jéron, Amélie Stainer +1
This article proposes novel off-line test generation techniques from non-deterministic timed automata with inputs and outputs (TAIOs) in the formal framework of the tioco conforman…