Zeno, Hercules and the Hydra: Downward rational termination is Ackermannian

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

Volumn 8087 LNCS, Issue , 2013, Pages 643-654

  Lazić, Ranko ^a   Ouaknine, Joël ^b   Worrell, James ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL MACHINES; FAIR TERMINATION; INSERTION ERRORS; LOWER BOUNDS; METRIC TEMPORAL LOGIC; RATIONAL RELATIONS; SATISFIABILITY;

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; LINEARIZATION; REAL TIME SYSTEMS;

EQUIVALENCE CLASSES;

EID: 84885198749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40313-2_57     Document Type: Conference Paper

References (22)

1. Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Meth. Sys. Des. 25(1), 39-65 (2004)
2. Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 35-48. Springer, Heidelberg (2004)
3. Alur, R., Henzinger, T.A.: Back to the future: Towards a theory of timed regular languages. In: FOCS, pp. 177-186. IEEE Comput. Soc. (1992)
4. Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, P., Worrell, J.: On termination and invariance for faulty channel machines. Formal Asp. Comput. 24(4-6), 595-607 (2012)
5. Bouyer, P., Markey, N., Ouaknine, J.,Worrell, J.: The cost of punctuality. In: LICS, pp. 109-120. IEEE Comput. Soc. (2007)
6. Chambart, P., Schnoebelen, P.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 265-276. Springer, Heidelberg (2007)
7. Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS, pp. 205-216. IEEE Comput. Soc. (2008)
8. Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson's Lemma. In: LICS, pp. 269-278. IEEE Comput. Soc. (2011), ext. ver. in CoRR, vol. abs/1007.2989
9. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
10. Friedman, H.: Long finite sequences. J. Combin. Theor., Ser. A 95(1), 102-144 (2001)
11. Henzinger, T.A.: The Temporal Specification and Verification of Real-Time Systems. Ph.D. thesis, Stanford University (1991), tech. rep. STAN-CS-91-1380
12. Henzinger, T.A.: It's about time: Real-time logics reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 439-454. Springer, Heidelberg (1998)
13. Jenkins, M.: Synthesis and Alternating Automata over Real Time. D.Phil. thesis, Oxford University (2012)
14. Karandikar, P., Schmitz, S.: The parametric ordinal-recursive complexity of Post embedding problems. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol. 7794, pp. 273-288. Springer, Heidelberg (2013)
15. Kirby, L., Paris, J.: Accessible independence results for Peano arithmetic. Bull. London Math. Soc. 14(4), 285-293 (1982)
16. Löb, M., Wainer, S.: Hierarchies of number-theoretic functions. I. Arch. Math. Log. 13(1), 39-51 (1970)
17. Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 217-230. Springer, Heidelberg (2006) (Pubitemid 44019342)
18. Ouaknine, J., Worrell, J.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 411-425. Springer, Heidelberg (2006) (Pubitemid 44019385)
19. Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic over finite words. Log. Meth. Comput. Sci. 3(1) (2007)
20. Sakarovitch, J.: Elements of Automata Theory. Camb. Univ. Press (2009)
21. Schmitz, S.: Scientific report - ESF Short Visit to Oxford University (2012)
22. Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616-628. Springer, Heidelberg (2010)