5 citations · 7 across the 4 of their papers we have counts for
5 papers
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…
Synthesis from LTL Specifications with Mean-Payoff Objectives
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot +1
The classical LTL synthesis problem is purely qualitative: the given LTL specification is realized or not by a reactive system. LTL is not expressive enough to formalize the correc…
The Complexity of Multi-Mean-Payoff and Multi-Energy Games
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen +3
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective…
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…
On Reachability for Hybrid Automata over Bounded Time
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts +3
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locati…