Balanced Timed Regular Expressions (joint work with E. Asarin)

Several authors have suggested classes of regular expressions for timed languages accepted by timed automata. In this article we introduce the class of balanced timed regular expressions with colored parentheses, which are equivalent to timed automata, and, differently from existing definitions, do not refer to clock values, and do not use bad operations such as intersection and renaming.

Proceedings of 3rd Workshop on Models for Time-Critical Systems (MTCS'02)”, Electronic Notes in Theoretical Computer Science, vol. 68, no. 5, 2002.

 gzipped postscript file.