Advertisement

Pumping Lemmas for timed automata

  • Danièle BeauquierEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1378)

Abstract

We remark that languages recognized by timed automata in the general case do not satisfy classical Pumping Lemma (PL) well known in the theory of finite automata. In this paper we prove two weaker versions of Pumping Lemma for timed words : a general one (DPL) where iterations preserve the duration of timed word, and another more restricted one, (LPL) when iterations preserve the length of timed word.

Keywords

Regular Expression Weak Version Regular Language Finite Automaton Atomic Proposition 
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.

References

  1. 1.
    R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.MathSciNetCrossRefGoogle Scholar
  2. 2.
    A. Henzinger and O. Kupferman. From quantity to quality. In Hybrid and Real-Time Systems Proceeding of HART'97, pages 48–62. Springer Verlag, 1997. Lect. Notes in Comput. Sci., vol. 1201.Google Scholar
  3. 3.
    F. Wang. Parametric timing analysis for real-time systems. Information and Computation, 130:131–150, 1996.zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    E. Asarin, P. Caspi, and O. Maler. A kleene theorem for timed automata. In IEEE Computer Society, LICS'97, pages 160–171, 1997.Google Scholar
  5. 5.
    T. Wilke. Automaten und Logiken fur zeitabhangige Systeme. Ph.d. thesis, Kiel University, 1994.Google Scholar
  6. 6.
    J. E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.Google Scholar
  7. 7.
    D. Beauquier and A. Slissenko. Decidable model checking for a class of timed automata specified in first order logic. Technical Report 97-11, University Paris-12, Department of Informatics, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  1. 1.Dept. of InformaticsUniversity Paris-12CréteilFrance

Personalised recommendations