Renaming is Necessary in Timed Regular Expressions

Authors:
Philippe Herrmann
Affiliations:
-
Venue:
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1999

Citing 6
Cited 1

A theory of timed automata

Theoretical Computer Science
Timed automata and recognizability

Information Processing Letters
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Removing epsilon-Transitions in Timed Automata

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A Kleene theorem for timed automata

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

Timed shuffle expressions

CONCUR 2005 - Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that timed regular expressions without renaming are strictly less expressive than timed automata, as conjectured by Asarin, Caspi and Maler in [3], where this extension of regular expressions was introduced. We also show how this result allows us to exhibit an infinite hierarchy of timed regular expressions.