The parametric ordinal-recursive complexity of post embedding problems

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

Volumn 7794 LNCS, Issue , 2013, Pages 273-288

  Karandikar, Prateek ^a,b   Schmitz, Sylvain ^b  

^a CMI   (India)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; EMBEDDING PROBLEMS; LOWER BOUNDS; RATIONAL RELATIONS; SUB WORDS;

ARTIFICIAL INTELLIGENCE;

EID: 84874423175     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-37075-5_18     Document Type: Conference Paper

References (27)

1. Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160, 109-127 (2000)
2. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inform. and Comput. 127(2), 91-101 (1996)
3. Atig, M.F., Bouajjani, A., Burckhardt, S., Musuvathi, M.: On the verification problem for weak memory models. In: POPL 2010, pp. 7-18. ACM (2010)
4. Barceló, P., Figueira, D., Libkin, L.: Graph logics with rational relations and the generalized intersection problem. In: LICS 2012, pp. 115-124. IEEE Press (2012)
5. Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, P., Worrell, J.: On termination and invariance for faulty channel machines. Form. Asp. Comput. 24(4), 595-607 (2012)
6. Cécé, G., Finkel, A., Purushothaman Iyer, S.: Unreliable channels are easier to verify than perfect channels. Inform. and Comput. 124(1), 20-31 (1996)
7. 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)
8. Chambart, P., Schnoebelen, P.: Mixing Lossy and Perfect Fifo Channels. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 340-355. Springer, Heidelberg (2008)
9. Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS 2008, pp. 205-216. IEEE Press (2008)
10. Chambart, P., Schnoebelen, P.: Pumping and Counting on the Regular Post Embedding Problem. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 64-75. Springer, Heidelberg (2010)
11. Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development 9(1), 47-68 (1965)
12. Fairtlough, M., Wainer, S.S.: Hierarchies of provably recursive functions. In: Handbook of Proof Theory, ch. III, pp. 149-207. Elsevier (1998)
13. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
14. Friedman, H.M.: Some decision problems of enormous complexity. In: LICS 1999, pp. 2-13. IEEE Press (1999)
15. Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In: LICS 2012, pp. 355-364. IEEE Press (2012)
16. Jančar, P., Karandikar, P., Schnoebelen, P.: Unidirectional Channel Systems Can Be Tested. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 149-163. Springer, Heidelberg (2012)
17. Jenkins, M.: Synthesis and Alternating Automata over Real Time. Ph.D. thesis, Oxford University (2012)
18. Karandikar, P., Schnoebelen, P.: Cutting through Regular Post Embedding Problems. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds.) CSR 2012. LNCS, vol. 7353, pp. 229-240. Springer, Heidelberg (2012)
19. Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Comput. Logic 9(2), 10 (2008)
20. Latteux, M., Leguy, J.: On the Composition of Morphisms and Inverse Morphisms. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 420-432. Springer, Heidelberg (1983)
21. Löb, M., Wainer, S.: Hierarchies of number theoretic functions, I. Arch. Math. Logic 13, 39-51 (1970)
22. Ouaknine, J., Worrell, J.B.: Safety Metric Temporal Logic Is Fully Decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 411-425. Springer, Heidelberg (2006)
23. Ouaknine, J.O., Worrell, J.B.: On the decidability and complexity of Metric Temporal Logic over finite words. Logic. Meth. in Comput. Sci. 3(1), 8 (2007)
24. Rose, H.E.: Subrecursion: Functions and Hierarchies, Oxford Logic Guides, vol. 9. Clarendon Press (1984)
25. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)
26. Schmitz, S., Schnoebelen, P.: Multiply-Recursive Upper Bounds with Higman's Lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 441-452. Springer, Heidelberg (2011)
27. Schmitz, S., Schnoebelen, P.: Algorithmic Aspects of WQO Theory. Lecture Notes (2012), http://cel.archives-ouvertes.fr/cel-00727025