Skip to main content
SpringerLink
Log in

Real-Time Automata and the Kleene Algebra of Sets of Real Numbers

  • Conference paper
  • First Online:
STACS 2000 (STACS 2000)

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

Included in the following conference series:

Abstract

A commutative complemented Kleene algebra of sets of (positive) real numbers is introduced. For the subalgebra generated by finite unions of rational intervals a normal form is found. These are then applied to the complementation problem for real-time automata.

This research was done during the author’s visit to TIFR, Bombay, supported by an extension of a UNU/IIST fellowship.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. A theory of timed automata, Theoretical Computer Science, 126:183–235, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Alur, L. Fix and T.A. Henzinger. A determinizable class of timed automata, in Computer-Aided Verification, LNCS 818:1–13, Springer Verlag, 1994.

    Google Scholar 

  3. R. Alur and T. Henzinger. The benefits of relaxing punctuality, Journal of ACM, 43:116–146, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Asarin, P. Caspi and O. Maler, A Kleene Theorem for Timed Automata, in G. Winskel (Ed.) Proc. LICS’97, p.160–171, 1997.

    Google Scholar 

  5. B. Bérard, V. Diekert, P. Gastin and A. Petit. Characterization of the expressive power of silent transitions in timed automata, Fundamenta Informaticæ, 36:145–182, 1998.

    MATH  Google Scholar 

  6. P. Bouyer and A. Petit, Decomposition and composition of timed automata, Proceedings of ICALP’99, LNCS series, 1999.

    Google Scholar 

  7. Ch. Choffrut and M. Goldwurm. Timed automata with periodic clock con-straints, LIAFA report, 1998.

    Google Scholar 

  8. J. H. Conway. Regular Algebra and Finite Machines, Chapman and Hall, 1971.

    Google Scholar 

  9. Dang Van Hung and Wang Ji, On the design of Hybrid Control Systems Using Automata Models, in V. Chandru and V. Vinay (Eds.) FSTTCS, LNCS 1180:156–167, 1996.

    Google Scholar 

  10. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence, 49:61–95, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  11. C. Dima. Timed Regular Expressions, Real-Time Automata and Simple Duration Calculus, draft of a UNU/IIST report, 1998. Available at http://funinf.math.unibuc.ro/~cdima/work/report.ps.gz.

  12. C. Dima. Automata and regular expressions for real-time languages, Proceedings of the AFL’99 workshop, Vasszeczeny, Hungary, 9–13 august 1999.

    Google Scholar 

  13. S. Eilenberg. Automata, Languages, and Machines, Vol. A, Academic Press, 1974.

    Google Scholar 

  14. T.A. Henzinger, J.-F. Raskin and P.-Y. Schobbens. The regular real-time languages, in Proc. 25-th ICALP, LNCS series, Springer Verlag, 1998.

    Google Scholar 

  15. John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley/Narosa Publishing House, eighth edition, New Delhi, 1992.

    Google Scholar 

  16. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, 110:366–390, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Fundamentals of Computer Science, Bucharest University, str. Academiei 14, Bucharest, Romania, R0-70109

    Cătălin Dima

Authors
  1. Cătălin Dima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Dept. of Theoretical Computer Science, Universität Dresden, 01062, Dresden, Germany

    Horst Reichel

  2. Université de Lille, LIFL - UPRESA 8022, CNRS, Bât. M3 - UFR IEEA, 59655, Villeneuve d’ASCQ Cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dima, C. (2000). Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-46541-3_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67141-1

  • Online ISBN: 978-3-540-46541-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation