4 citations · 4 across the 1 of their papers we have counts for
1 paper
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…