An algebraic characterization of data and timed languages

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

Volumn 2154, Issue , 2001, Pages 248-261

  Bouyer, Patricia ^a   Petit, Antoine ^a   Thérien, Denis ^b  

^a CNRS   (France)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLASSICAL SITUATIONS; CLOSURE PROPERTY; RECOGNIZABLE LANGUAGES; TIMED AUTOMATA; TIMED LANGUAGES;

ALGEBRA;

EID: 84944033436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_17     Document Type: Conference Paper

References (18)

1. Autebert, J.-M., Beauquier, J., and Boasson, L. Langages sur des alphabets infinis. Discrete Applied Mathematics, vol. 2:1–20, 1980.
2. Asarin, E., Caspi, P., and Maler, O. A Kleene Theorem for Timed Automata. In Proc. 12th IEEE Symp. Logic in Computer Science (LICS’97), pp. 160–171. IEEE Computer Society Press, June 1997.
3. Alur, R. and Dill, D. A Theoryof Timed Automata. Theoretical Computer Science, vol. 126(2):183–235, 1994.
4. Alur, R., Fix, L., and Henzinger, T. A. Event-Clock Automata: a Determinizable Class of Timed Automata. In Proc. 6th Int. Conf. Computer Aided Verification (CAV’94), vol. 818 of Lecture Notes in Computer Science, pp. 1–13. Springer-Verlag, June 1994.
5. Asarin, E. Equations on Timed Languages. In Hybrid Systems: Computation and Control, vol. 1386 of Lecture Notes in Computer Science. Springer-Verlag, Apr. 1998.
6. Bouyer, P. and Petit, A. Decomposition and Composition of Timed Automata. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP’99), vol. 1644 of Lecture Notes in Computer Science, pp. 210–219. Springer-Verlag, July 1999.
7. Bouyer, P. and Petit, A. A Kleene/Büchi-like Theorem for Clock Languages. Journal of Automata, Languages and Combinatorics, 2001. To appear.
8. Bouyer, P., Petit, A., and Thérien, D. An Algebraic Characterization of Data and Timed Languages. Research report LSV-01-1, Laboratoire Spécification et Vérification, Ecole Normale Supérieure de Cachan, 2001.
9. Choffrut, C. and Goldwurm, M. Timed Automata with Periodic Clock Constraints. Journal of Automata, Languages and Combinatorics, vol. 5(4):371–404, 2000.
10. Clarke, E., Grumberg, O., and Peled, D. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
11. Demichelis, F. and Zielonka, W. Controlled Timed Automata. In Proc. 9th Int. Conf. ConcurrencyThe ory(CONCUR’98), vol. 1466 of Lecture Notes in Computer Science, pp. 455–469. Springer-Verlag, Sep. 1998.
12. Henzinger, T. A., Kopke, P. W., and Wong-Toi, H. The Expressive Power of Clocks. In Proc. 22nd Int. Coll. Automata, Languages, and Programming (ICALP’95), vol. 944 of Lecture Notes in Computer Science, pp. 335–346. Springer-Verlag, July 1995.
13. Henzinger, T. A., Raskin, J.-F., and Schobbens, P.-Y. The Regular Real-Time Languages. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP’98), vol. 1443 of Lecture Notes in Computer Science, pp. 580–591. Springer-Verlag, July 1998.
14. Kaminski, M. and Francez, N. Finite-MemoryA utomata. Theoretical Computer Science, vol. 134:329–363, 1994.
15. Minsky, M. Computation: Finite and Infinite Machines. Prentice Hall Int., 1967.
16. Pin, J.-E. Varieties of Formal Languages. North Oxford, London et Plenum, New-York, 1986.
17. Rozenberg, G. and Salomaa, A., eds. Handbook of Formal Languages. Springer-Verlag, 1997.
18. Wilke, T. Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. In Proc. 3rd Int. Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT’94), vol. 863 of Lecture Notes in Computer Science, pp. 694–715. Springer-Verlag, Sep. 1994.