Regular Expressions with Timed Dominoes

  • Cătălin Dima
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2731)


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.


Regular Expression Action Symbol Time Automaton Time Binding Operator Clock Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ACM97.
    E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. In Proceedings of LICS’97, pages 160–171, 1997.Google Scholar
  2. ACM02.
    E. Asarin, P. Caspi, and O. Maler. Timed regular expressions. Journal of ACM, 49:172–206, 2002.CrossRefMathSciNetGoogle Scholar
  3. AD94.
    R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  4. AD02.
    E. Asarin and C. Dima. Balanced timed regular expressions. In Proceedings of MTCS’02, 2002. extended version to be published in ENTCS vol. 68.Google Scholar
  5. BE97.
    S.L. Bloom and Z. Ésik. Axiomatizing shuffle and concatenation in languages. Information and Computation, 139:62–91, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  6. Bel57.
    R. Bellmann. Dynamic Programming. Princeton University Press, 1957.Google Scholar
  7. BP99.
    P. Bouyer and A. Petit. Decomposition and composition of timed automata. In Proceedings of ICALP’99, volume 1644 of LNCS, pages 210–219, 1999.Google Scholar
  8. BP02.
    P. Bouyer and A. Petit. A Kleene/Büchi-like theorem for clock languages. Journal of Automata, Languages and Combinatorics, 2002. To appear.Google Scholar
  9. Con71.
    J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.Google Scholar
  10. Dim99.
    C. Dima. Kleene theoremsfor event-clock automata. In Proceedings of FCT’99, volume 1684 of LNCS, pages 215–225, 1999.Google Scholar
  11. Dim01.
    C. Dima. An algebraic theory of real-time formal languages. PhD thesis, Université Joseph Fourier Grenoble, France, 2001.Google Scholar
  12. Dim02.
    C. Dima. Computing reachability relationsin timed automata. In Proceedings of LICS’02, pages177–186, 2002.Google Scholar
  13. Eil74.
    S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, 1974.Google Scholar
  14. Koz94.
    D. Kozen. A completenessth eorem for Kleene algebrasan d the algebra of regular events. Information and Computation, 110:366–390, 1994.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Cătălin Dima
    • 1
  1. 1.ENSEIRB & LaBRIDomaine UniversitaireTalence CedexFrance

Personalised recommendations