52 citations · 149 across the 34 of their papers we have counts for
4 papers · 1 filter
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…
Multiplayer Cost Games with Simple Nash Equilibria
Thomas Brihaye, Julie De Pril, Sven Schewe
Multiplayer games with selfish agents naturally occur in the design of distributed and embedded systems. As the goals of selfish agents are usually neither equivalent nor antagonis…
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Thomas Brihaye, Véronique Bruyère, Julie De Pril
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with both reachability and safety objectives. In this framework a player with…
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Thomas Brihaye, Véronique Bruyère, Julie De Pril +1
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set o…