Relating timed and register automata

Mathematical Structures in Computer Science

Volumn 26, Issue 6, 2016, Pages 993-1021

  Figueira, Diego ^a,b,c   Hofman, Piotr ^c   Lasota, SŁawomir ^c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLOCKS; COMPUTABILITY AND DECIDABILITY;

ALTERNATING AUTOMATA; COMPLEXITY RESULTS; DECISION PROBLEMS; EXPONENTIAL TIME; INFINITE WORD; MODELS OF COMPUTATION; NON-PRIMITIVE RECURSIVE COMPLEXITY; TIMED AUTOMATA;

DECISION THEORY;

EID: 84916899673     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129514000322     Document Type: Conference Paper

References (26)

1. Abdulla, P. A., Deneux, J., Ouaknine, J. and Worrell, J. (2005) Decidability and complexity results for timed automata via channel machines. In: ICALP 1089-1101.
2. Alur, R. and Dill, D. L. (1994) A theory of timed automata. Theoretical Computer Science 126 183-235.
3. Benedikt, M., Ley, C. and Puppis, G. (2010) What you must remember when processing data words. In: AMW.
4. Bojanćzyk, M. and Lasota, S. (2012) A machine-independent characterization of timed languages. In: Proceedings ICALP'12. Springer Lecture Notes in Computer Science 7392 92-103.
5. Bojanćzyk, M., Klin, B. and Lasota, S. (2011) Automata with group actions. In: Proceedings LICS'11 355-364.
6. Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, P. and Worrell, J. (2008) On termination for faulty channel machines. In: STACS 121-132.
7. Bouyer, P., Petit, A. and Thérien, D. (2003) An algebraic approach to data languages and timed languages. Information and Computation 182 (2) 137-162.
8. Chambart, P. and Schnoebelen, P. (2008) The ordinal recursive complexity of lossy channel systems. In: LICS, IEEE Computer Society Press 205-216. Available at http://www. lsv. enscachan. fr/Publis/PAPERS/PDF/CS-lics08. pdf.
9. Demri, S. and Lazić, R. (2009) LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic (TOCL) 10 (3) Article No. 16, ACM.
10. Figueira, D., Figueira, S., Schmitz, S. and Schnoebelen, P. (2011) Ackermannian and primitiverecursive bounds with Dickson's lemma. In: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS), Toronto, Ontario, Canada 269-278. Available at: http://doi. ieeecomputersociety. org/10. 1109/LICS. 2011. 39.
11. Figueira, D., Hofman, P., and Lasota, S. (2010) Relating timed and register automata. In: Proceedings 17th International Workshop on Expressiveness in Concurrency, EXPRESS'10, Paris, France 61-75. Available at: http://dx. doi. org/10. 4204/EPTCS. 41. 5.
12. Figueira, D. and Segoufin, L. (2009) Future-looking logics on data words and trees. In: MFCS 331-343.
13. Jenkins, M., Ouaknine, J., Rabinovich, A. and Worrell, J. (2010) Alternating timed automata over bounded time. In: LICS, IEEE Computer Society Press.
14. Kaminski, M and Francez, N. (1994) Finite-memory automata. Theoretical Computer Science 134 (2) 329-363.
15. Lasota, S. and Walukiewicz, I. (2005) Alternating timed automata. In: FoSSaCS 250-265.
16. Lasota, S. and Walukiewicz, I. (2008) Alternating timed automata. ACM Transactions on Computational Logic (TOCL) 9 (2) Article No. 10, ACM.
17. Lazić, R. (2006) Safely freezing LTL. In: FSTTCS 381-392.
18. Lazić, R. (2008) Safety alternating automata on data words. In: CoRR, ArXiv:0802. 4237.
19. Löb, M. H. and Wainer, S. S. (1970) Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung 13 39-51.
20. Neven, F., Schwentick, T. and Vianu, V. (2004) Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 5 (3) 403-435.
21. Ouaknine, J. and Worrell, J. (2004) On the language inclusion problem for timed automata: Closing a decidability gap. In: LICS, IEEE Computer Society Press 54-63.
22. Ouaknine, J. and Worrell, J. (2005) On the decidability of metric temporal logic. In: LICS, IEEE Computer Society Press 188-197.
23. Ouaknine, J. and Worrell, J. (2006) Safety metric temporal logic is fully decidable. In: TACAS 411-425.
24. Parys, P. and Walukiewicz, I. (2009) Weak alternating timed automata. In: ICALP 273-284.
25. Parys, P. and Walukiewicz, I. (2011) Personal communication.
26. Schnoebelen, P. (2010) Revisiting Ackermann-Hardness for lossy counter machines and reset Petri nets. In: MFCS 2010. Springer Lecture Notes in Computer Science 6281 616-628. Available at: http://dx. doi. org/10. 1007/978-3-642-15155-2 54.