Pumping Lemmas for timed automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1378, Issue , 1998, Pages 81-94

  Beauquier, Danièle ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PUMPS;

PUMPING LEMMA; TIMED AUTOMATA;

COMPUTATION THEORY;

EID: 84947942218     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053543     Document Type: Conference Paper

References (7)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
2. A. Henzinger and O. Kupferman. FVom quantity to quality. In Hybrid and RealTime Systems Proceeding of HART’97, pages 48-62. Springer Verlag, 1997. Lect. Notes in Comput. Sci., vol. 1201.
3. F. Wang. Parametric timing analysis for real-time systems. Information and Computation, 130:131-150, 1996.
4. E. Asarin, P. Caspi, and O. Maler. A kleene theorem for timed automata. In IEEE Computer Society, LICS’97, pages 160-171, 1997.
5. T. Wilke. Automaten und Logiken fur zeitabhangige Systeme. Ph.d. thesis, Kiel University, 1994.
6. J. E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
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.