Regular expressions with timed dominoes

Authors:
Cătălin Dima
Affiliations:
ENSEIR, Talence Cedex, France and LaBRI, Talence Cedex, France
Venue:
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Year:
2003

Citing 8
Cited 1

A theory of timed automata

Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Axiomatizing shuffle and concatenation in languages

Information and Computation
Timed regular expressions

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Computing Reachability Relations in Timed Automata

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Kleene/Büchi-like theorem for clock languages

Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
A Kleene theorem for timed automata

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

On Equivalences for a Class of Timed Regular Expressions

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a class of timed regular expressions that involve the use of colored parentheses for specifying timing constraints. The expressions are given in a matricial format, and their semantics is based upon an "overlapping concatenation" of timed words. We then give a calculus for emptiness checking of a regular expression, that does not go through translating expressions into timed automata. To this end we use the class of 2n-automata, studied in a parallel paper [Dim02] in connection with the problem of representing timing constraints.