5 citations · 6 across the 3 of their papers we have counts for
3 papers
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…
cs.LO2014★ 5 cited
A composable language for action models
Tim French, James Hales, Edwin Tay
Action models are semantic structures similar to Kripke models that represent a change in knowledge in an epistemic setting. Whereas the language of action model logic embeds the s…