On Timed Automata with Discrete Time—Structural and Language ...


Hermann Gruber, Markus Holzer, Astrid Kiehn, and Barbara König. On timed automata with discrete time—structural and language theoretical characterization. In Proc. of DLT '05 (Developments in Language Theory), pages 272–283. Springer, 2005. LNCS 3572.


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.

Suggested BibTeX entry:

    author = {Hermann Gruber and Markus Holzer and Astrid Kiehn and Barbara K{\"o}nig},
    booktitle = {Proc. of DLT '05 (Developments in Language Theory)},
    note = {{LNCS} 3572},
    pages = {272--283},
    publisher = {Springer},
    title = {On Timed Automata with Discrete Time---Structural and Language Theoretical Characterization},
    year = {2005}

GZipped PostScript (81 kB)PDF (144 kB)
© University of Duisburg-Essen, Theoretical Computer Science group