Hourglass Automata

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...

Full description

Bibliographic Details
Main Authors: Yuki Osada, Tim French, Mark Reynolds, Harry Smallbone
Format: Article
Language:English
Published: Open Publishing Association 2014-08-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1408.5965v1