An algebraic approach to data languages and timed languages

Information and Computation

Volumn 182, Issue 2, 2003, Pages 137-162

  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

FINITE AUTOMATA; FORMAL LOGIC; HIERARCHICAL SYSTEMS; POLYNOMIALS; QUERY LANGUAGES;

DATA LANGUAGES;

DATABASE SYSTEMS;

EID: 0038176921     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00038-5     Document Type: Article

References (25)

1. J.-M. Autebert, J. Beauquier, L. Boasson, Langages sur des alphabets infinis, Discrete Applied Mathematics 2 (1980) 1-20.
2. E. Asarin, P. Caspi, O. Maler, A Kleene theorem for timed automata, in: Proceedings of the 12th IEEE Symposium on Logic in Computer Science (LICS'97), IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 160-171.
3. E. Asarin, P. Caspi, O. Maler, Timed regular expressions, Journal of the Association for Computing Machinery (JACM) 49 (2) (2002) 172-206.
4. R. Alur, D. Dill, A theory of timed automata, Theoretical Computer Science (TCS) 126 (2) (1994) 183-235.
5. R. Alur, L. Fix, T.A. Henzinger, A determinizable class of timed automata, in: Proceedings of the 6th International Conference on Computer Aided Verification (CAV'94), Lecture Notes in Computer Science, vol. 818, Springer, Berlin, 1994, pp. 1-13.
6. E. Asarin, Equations on timed languages, in: Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control (HSCC'98), Lecture Notes in Computer Science, vol. 1386, Springer, Berlin, 1998, pp. 1-12.
7. 1, Journal of Computer and Systems Science (JCSS) 38 (1) (1989) 150-164.
8. P. Bouyer, A logical characterization of data languages, Information Processing Letters (IPL) 84 (2) (2002) 75-85.
9. P. Bouyer, A. Petit, Decomposition and composition of timed automata, in: Proceedings of the 26th International Colloquium on Automata. Languages and Programming (ICALP'99), Lecture Notes in Computer Science, vol. 1644, Springer, Berlin, 1999, pp. 210-219.
10. P. Bouyer, A. Petit, A Kleene/Büchi-like theorem for clock languages, Journal of Automata, Languages and Combinatorics (JALC) 7 (2) (2002) 167-186.
11. P. Bouyer, A. Petit, D. Thérien, An algebraic characterization of data and timed languages, in: Proceedings of the 12th International Conference on Concurrency Theory (CONCUR'01), Lecture Notes in Computer Science, vol. 2154, Springer, Berlin, 2001, pp. 248-261.
12. C. Choffrut, M. Goldwurm, Timed automata with periodic clock constraints, Journal of Automata, Languages and Combinatorics (JALC) 5 (4) (2000) 371-404.
13. E. Clarke, O. Grumberg, D. Peled, Model-Checking, The MIT Press, Cambridge, MA, 1999.
14. F. Demichelis, W. Zielonka, Controlled timed automata, in: Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98), Lecture Notes in Computer Science, vol. 1466, Springer, Berlin, 1998, pp. 455-469.
15. T.A. Henzinger, P.W. Kopke, H. Wong-Toi, The expressive power of clocks, in: Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 417-428.
16. U. Hertrampf, C. Lauteman, T. Schwentick, H. Vollmer, K.W. Wagner, On the power of polynomial time bit-reductions, in: Proceedings of the 8th Structure in Complexity Theory Conference (CoCo), IEEE Computer Society Press, Silver Spring, MD, 1993, pp. 200-207.
17. T.A. Henzinger, J.-F. Raskin, P.-Y. Schobbens, The regular real-time languages, in: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98), Lecture Notes in Computer Science, vol. 1443, Springer, Berlin, 1998, pp. 580-591.
18. J.A. Kamp, Tense logic and the theory of linear order, Ph.D. thesis, UCLA, Los Angeles, CA, USA, 1968.
19. M. Kaminski, N. Francez, Finite-memory automata, Theoretical Computer Science (TCS) 134 (2) (1994) 329-363.
20. M. Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, NJ, 1967.
21. F. Neven, T. Schwentick, V. Vianu, Towards regular languages over infinite alphabets, in: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS'01), Lecture Notes in Computer Science, vol. 2136, Springer, Berlin, 2001, pp. 560-572.
22. J.-É. Pin, Varieties of Formal Languages, North Oxford/Plenum, London/New York, 1986.
23. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Berlin, 1997.
24. M.-P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control 8 (2) (1965) 190-194.
25. T. Wilke, Specifying timed state sequences in powerful decidable logics and timed automata, in: Proceedings of the 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'94), Lecture Notes in Computer Science, vol. 863, Springer, Berlin, 1994, pp. 694-715.