A machine-independent characterization of timed languages

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

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 92-103

  Bojańczyk, Mikołaj ^a   Lasota, Sławomir ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

NOMINAL SETS; TIMED AUTOMATA; TIMED LANGUAGES;

AUTOMATA THEORY;

EID: 84883368723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_12     Document Type: Conference Paper

References (16)

1. Alur, R., Courcoubetis, C., Halbwachs, N., Dill, D.L., Wong-Toi, H.: Minimization of Timed Transition Systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 340-354. Springer, Heidelberg (1992)
2. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183-235 (1994)
3. Bojánczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: Proc. LICS 2011, pp. 355-364 (2011)
4. Bojánczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets (submitted, 2012), http://www.mimuw.edu.pl/~sl/PAPERS/lics11full.pdf
5. Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Updatable timed automata. Theor. Comput. Sci. 321(2-3), 291-345 (2004)
6. Bouyer, P., Petit, A., Th́erien, D.: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2), 137-162 (2003)
7. Choffrut, C., Goldwurm, M.: Timed automata with periodic clock constraints. Journal of Automata, Languages and Combinatorics 5(4), 371-404 (2000)
8. Finkel, O.: Undecidable problems about timed automata. CoRR, abs/0712.1363 (2007)
9. Francez, N., Kaminski, M.: Finite-memory automata. TCS 134(2), 329-363 (1994)
10. Gabbay, M.: Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bulletin of Symbolic Logic 17(2), 161-229 (2011)
11. Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput. 13(3-5), 341-363 (2002)
12. Henzinger, T.A.: The theory of hybrid automata. In: LICS, pp. 278-292 (1996)
13. Maler, O., Pnueli, A.: On Recognizable Timed Languages. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 348-362. Springer, Heidelberg (2004)
14. Springintveld, J., Vaandrager, F.W.: Minimizable Timed Automata. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 130-147. Springer, Heidelberg (1996)
15. Tripakis, S.: Folk theorems on the determinization and minimization of timed automata. Inf. Process. Lett. 99(6), 222-226 (2006)
16. Yannakakis, M., Lee, D.: An efficient algorithm for minimizing real-time transition systems. Formal Methods in System Design 11(2), 113-136 (1997)