Skip to main content
SpringerLink
Log in

Renaming Is Necessary in Timed Regular Expressions

  • Conference paper
  • First Online:
Book cover Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1738))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and D.L. Dill: Automata for Modelling Real-Time Systems. Proceedings of ICALP’90, LNCS 443, pages 322–335, 1990. 49

    Google Scholar 

  2. R. Alur and D.L. Dill: A Theory of Timed Automata, Theoretical Computer Science 126, pages 183–235, 1994. 47

    Article  MATH  MathSciNet  Google Scholar 

  3. E. Asarin, P. Caspi and O. Maler: A Kleene Theorem for Timed Automata. Proceedings of LICS’97, pages 160–170, 1997. 47, 47, 47, 48, 50, 52, 53, 58

    Google Scholar 

  4. B. Bérard, V. Diekert, P. Gastin and A. Petit: Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundamenta Informaticœ 36, pages 145–182, 1998. 50

    MATH  Google Scholar 

  5. V. Diekert, P. Gastin and A. Petit: Removing ε-Transitions in Timed Automata. Proceedings of STACS’97, LNCS 1200, pages 583–594, 1997.

    Google Scholar 

  6. P. Herrmann: Timed Automata and Recognizability. Information Processing Letters 65, pages 313–318, 1998. 50, 51

    Article  MATH  MathSciNet  Google Scholar 

  7. S.C. Kleene, Representations of Events in Nerve Nets and Finite Automata. Automata Studies, pages 3–42, 1956. 47

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris 7 2, place Jussieu, F-75251, Paris Cedex 05, France

    Philippe Herrmann

Authors
  1. Philippe Herrmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, 600036, India

    C. Pandu Rangan

  2. Institute of Mathematical Sciences C.I.T. Campus, Chennai, 600113, India

    V. Raman  & R. Ramanujam  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herrmann, P. (1999). Renaming Is Necessary in Timed Regular Expressions. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-46691-6_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66836-7

  • Online ISBN: 978-3-540-46691-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation