7 citations · 31 across the 19 of their papers we have counts for
3 papers · 1 filter
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…
A faster exact multiprocessor schedulability test for sporadic tasks
Markus Lindström, Gilles Geeraerts, Joël Goossens
Baker and Cirinei introduced an exact but naive algorithm, based on solving a state reachability problem in a finite automaton, to check whether sets of sporadic hard real-time tas…
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…