33 citations · 99 across the 17 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2016
Finding Minimum and Maximum Termination Time of Timed Automata Models with Cyclic Behaviour
Omar Al-Bataineh, Mark Reynolds, Tim French
The paper presents a novel algorithm for computing best and worst case execution times (BCET/WCET) of timed automata models with cyclic behaviour. The algorithms can work on any ar…
cs.FL2014★ 1 cited
Hourglass Automata
Yuki Osada, Tim French, Mark Reynolds +1
In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate…