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.
Chapter PDF
Keywords
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
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
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.
F. Wang. Parametric timing analysis for real-time systems. Information and Computation, 130:131–150, 1996.
E. Asarin, P. Caspi, and O. Maler. A kleene theorem for timed automata. In IEEE Computer Society, LICS'97, pages 160–171, 1997.
T. Wilke. Automaten und Logiken fur zeitabhangige Systeme. Ph.d. thesis, Kiel University, 1994.
J. E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, D. (1998). Pumping Lemmas for timed automata. In: Nivat, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1998. Lecture Notes in Computer Science, vol 1378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053543
Download citation
DOI: https://doi.org/10.1007/BFb0053543
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64300-5
Online ISBN: 978-3-540-69720-6
eBook Packages: Springer Book Archive