On timed automata with discrete time – structural and language theoretical characterization

Authors:
Hermann Gruber;Markus Holzer;Astrid Kiehn;Barbara König
Affiliations:
Institut für Informatik, Technische Universität München, Garching bei München, Germany;Institut für Informatik, Technische Universität München, Garching bei München, Germany;Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India;Institut für Formale Methoden der Informatik, Universität Stuttgart, Stuttgart, Germany
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 7
Cited 1

A theory of timed automata

Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Timed automata with periodic clock constraints

Journal of Automata, Languages and Combinatorics
The Expressive Power of Clocks

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Pumping Lemmas for Timed Automata

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Logics and Models of Real Time: A Survey

Proceedings of the Real-Time: Theory in Practice, REX Workshop

Reachability of communicating timed processes

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.