Advertisement

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

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

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.

Keywords

Normal Form Boolean Algebra Regular Expression Regular Language Rational Interval 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AD94]
    R. Alur and D.L. Dill. A theory of timed automata, Theoretical Computer Science, 126:183–235, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [AFH94]
    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. [AH96]
    R. Alur and T. Henzinger. The benefits of relaxing punctuality, Journal of ACM, 43:116–146, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [ACM97]
    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. [BDGP98]
    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.zbMATHGoogle Scholar
  6. [BP99]
    P. Bouyer and A. Petit, Decomposition and composition of timed automata, Proceedings of ICALP’99, LNCS series, 1999.Google Scholar
  7. [CG98]
    Ch. Choffrut and M. Goldwurm. Timed automata with periodic clock con-straints, LIAFA report, 1998.Google Scholar
  8. [Con71]
    J. H. Conway. Regular Algebra and Finite Machines, Chapman and Hall, 1971.Google Scholar
  9. [DW96]
    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. [DMP91]
    R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence, 49:61–95, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [Dim98]
    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. [Dim99]
    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. [Ei74]
    S. Eilenberg. Automata, Languages, and Machines, Vol. A, Academic Press, 1974.Google Scholar
  14. [HRS98]
    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. [HU]
    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. [Koz94]
    D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, 110:366–390, 1994.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Cătălin Dima
    • 1
  1. 1.Department of Fundamentals of Computer ScienceBucharest UniversityBucharestRomania

Personalised recommendations