2014/08/26 by Yuki Osada, Tim French, Mark Reynolds +1
Computer Science · #cs.FL
paper · pdf · doi:10.4204/eptcs.161.16
published as EPTCS 161, 2014, pp. 175-188 · In Proceedings GandALF 2014, arXiv:1408.5560
arxiv created 2014/08/26 · arxiv updated 2014/08/27
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. We then introduce a new clock update for timed automata that allows hourglass automata to be expressed. This allows us to show that language emptiness remains decidable with this update when the number of clocks is two or less. This is done by showing that we can construct a finite untimed graph using clock regions from any timed automaton that use this new update.