7 citations · 31 across the 19 of their papers we have counts for
4 papers · 1 filter
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +1
Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games (that can be seen as a refinement of the well-studied mean-payoff games) are…
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…
Adding Negative Prices to Priced Timed Games
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna +3
Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of configurations of priced timed automata where two players take turns to choose transitions i…