7 citations · 31 across the 19 of their papers we have counts for
7 papers · 1 filter
Real-Time Synthesis is Hard!
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts +3
We study the reactive synthesis problem (RS) for specifications given in Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very general setting, but on infi…
On MITL and alternating timed automata over infinite words
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL. In this paper, we consider the…
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…
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts +3
In this paper, we study thetime-bounded reachability problem for rectangular hybrid automata with non-negative rates (RHA+). This problem was recently shown to be decidable [Brihay…
Queue-Dispatch Asynchronous Systems
Gilles Geeraerts, Alexander Heußner, Jean-François Raskin
To make the development of efficient multi-core applications easier, libraries, such as Grand Central Dispatch, have been proposed. When using such a library, the programmer writes…
Event-Clock Automata: From Theory to Practice
Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder
Event clock automata (ECA) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properti…