7 citations · 31 across the 19 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 2 cited
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…
cs.LO2012★ 3 cited
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…