On Timed Automata with Discrete Time-Structural and Language Theoretical Characterization
In: Proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005. - (Lecture Notes in Computer Science ; 3572)
Berlin [u.a.]: Springer (2005), S. 272-283
Buchaufsatz / Kapitel / Fach: Informatik
We develop a structural and language theoretical characterization of timed languages over discrete time in terms of a variant of Büchi automata and languages. The so-called tick automaton is a standard Büchi 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.