On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization

We develop a structural and language theoretical characterization of timed languages over discrete time in terms of a variant of Buchi automata and languages. The so-called tick automaton is a standard Buchi automaton with a special “clock-tick”-input symbol modeling the discrete flow of time. Based on these characterizations we give an alternative proof for the fact that the class of regular timed languages is closed under complementation and formulate a time-warp lemma which, similar to a pumping lemma, can be used to show that a timed language is not regular. The characterizations hold alike for timed automata with and without periodic clock constraints.