On recognizable timed languages

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

Volumn 2987, Issue , 2004, Pages 348-362

  Maler, Oded ^a,b   Pnueli, Amir ^a,c  

^a VERIMAG   (France)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

BOUNDED SUBSET; FINITE STATE; MORPHISMS; RECOGNIZABLE LANGUAGES; TIMED AUTOMATA; TIMED LANGUAGES;

COMPUTATIONAL LINGUISTICS;

EID: 21144454098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_25     Document Type: Article

References (18)

1. [A90] R. Alur, Techniques for Automatic Verification of Real-Time Systems, PhD Thesis, Stanford, 1990.
2. [AD94] R. Alur and D.L. Dill, A Theory of Timed Automata, Theoretical Computer Science 126,183-235, 1994.
3. [AFH99] R. Alur, L. Fix, and T.A. Henzinger, Event-Clock Automata: A Determinizable Class of Timed Automata, Theoretical Computer Science 211, 253-273, 1999.
4. [A87] D. Angluin, Learning Regular Sets from Queries and Counter-Examples, Information and Computation 75, 87-106,1987.
5. [ACM02] E. Asarin, P. Caspi and O. Maler, Timed Regular Expressions The Journal of the ACM 49, 172-206, 2002.
6. [B03] P. Bouyer, Untameable Timed Automata!, Proc. STACS'03, 620-631, LNCS 2607, Springer, 2003.
7. [BDFP00] P. Bouyer, C. Dufourd, E. Fleury and A. Petit, Expressiveness of Updatable Timed Automata, Proc. MFCS'2000, 232-242, LNCS 1893, Springer, 2000.
8. [BPT03] P. Bouyer, A. Petit, and D. Thérien, An algebraic Approach to Data Languages and Timed Languages, Information and Computation 182, 137-162, 2003.
9. [D01] C. Dima, Real-Time Automata, Journal of Automata, Languages and Combinatorics 6, 3-24, 2001.
10. DY96] C. Daws and S. Yovine, Reducing the Number of Clock Variables of Timed Automata, Proc. RTSS'96,73-81, IEEE, 1996.
11. [E74] S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, NewYork, 1974.
12. [G72] E.M. Gold, System Identification via State Characterization, Automatica 8, 621636, 1972.
13. [HRS98] T.A. Henzinger, J.-F. Raskin, and P.-Y. Schobbens, The Regular Real-time Languages, Proc. ICALP 98, 580-591, LNCS 1343, Springer, 1998.
14. [KF94] M. Kaminski and N. Francez, Finite-memory Automata, Theoretical Computer Science 134, 329-363, 1994.
15. [RS97] J.-F. Raskin and P.-Y. Schobbens, State Clock Logic: A Decidable Real-Time Logic, in Hybrid and Real-Time Systems (HART), 33-47, LNCS 1201, Springer, 1997.
16. [T03] S. Tripakis, Folk Theorems on the Determinization and Minimization of Timed Automata, Proc. FORMATS'03, 2003.
17. [SV96] J.G. Springintveld and F.W. Vaandrager, Minimizable Timed Automata, Proc. FTRTFT'96,130-147, LNCS 1135, Springer, 1996.
18. [W94] Th. Wilke, Specifying State Sequences in Powerful Decidable Logics and Timed Automata, Proc. FTRTFT'94, LNCS 863, 694-715, Springer, 1994.