{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:23:58Z","timestamp":1726410238883},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_57","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"643-654","source":"Crossref","is-referenced-by-count":0,"title":["Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"57_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/B:FORM.0000033962.51898.1a","volume":"25","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Meth. Sys. Des.\u00a025(1), 39\u201365 (2004)","journal-title":"Formal Meth. Sys. Des."},{"key":"57_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-28644-8_3","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.A. Abdulla","year":"2004","unstructured":"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.\u00a03170, pp. 35\u201348. Springer, Heidelberg (2004)"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A.: Back to the future: Towards a theory of timed regular languages. In: FOCS, pp. 177\u2013186. IEEE Comput. Soc. (1992)","DOI":"10.1109\/SFCS.1992.267774"},{"issue":"4-6","key":"57_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00165-012-0234-7","volume":"24","author":"P. Bouyer","year":"2012","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, P., Worrell, J.: On termination and invariance for faulty channel machines. Formal Asp. Comput.\u00a024(4-6), 595\u2013607 (2012)","journal-title":"Formal Asp. Comput."},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: LICS, pp. 109\u2013120. IEEE Comput. Soc. (2007)","DOI":"10.1109\/LICS.2007.49"},{"key":"57_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-77050-3_22","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"P. Chambart","year":"2007","unstructured":"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.\u00a04855, pp. 265\u2013276. Springer, Heidelberg (2007)"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS, pp. 205\u2013216. IEEE Comput. Soc. (2008)","DOI":"10.1109\/LICS.2008.47"},{"key":"57_CR8","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s Lemma. In: LICS, pp. 269\u2013278. IEEE Comput. Soc. (2011), ext. ver. in CoRR, vol. abs\/1007.2989"},{"issue":"1-2","key":"57_CR9","first-page":"63","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Comput. Sci."},{"issue":"1","key":"57_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jcta.2000.3154","volume":"95","author":"H. Friedman","year":"2001","unstructured":"Friedman, H.: Long finite sequences. J. Combin. Theor., Ser. A\u00a095(1), 102\u2013144 (2001)","journal-title":"J. Combin. Theor., Ser. A"},{"key":"57_CR11","unstructured":"Henzinger, T.A.: The Temporal Specification and Verification of Real-Time Systems. Ph.D. thesis, Stanford University (1991), tech. rep. STAN-CS-91-1380"},{"key":"57_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BFb0055640","volume-title":"CONCUR \u201998 Concurrency Theory","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A.: It\u2019s about time: Real-time logics reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 439\u2013454. Springer, Heidelberg (1998)"},{"key":"57_CR13","unstructured":"Jenkins, M.: Synthesis and Alternating Automata over Real Time. D.Phil. thesis, Oxford University (2012)"},{"key":"57_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-37075-5_18","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Karandikar","year":"2013","unstructured":"Karandikar, P., Schmitz, S.: The parametric ordinal-recursive complexity of Post embedding problems. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol.\u00a07794, pp. 273\u2013288. Springer, Heidelberg (2013)"},{"issue":"4","key":"57_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1112\/blms\/14.4.285","volume":"14","author":"L. Kirby","year":"1982","unstructured":"Kirby, L., Paris, J.: Accessible independence results for Peano arithmetic. Bull. London Math. Soc.\u00a014(4), 285\u2013293 (1982)","journal-title":"Bull. London Math. Soc."},{"issue":"1","key":"57_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01967649","volume":"13","author":"M. L\u00f6b","year":"1970","unstructured":"L\u00f6b, M., Wainer, S.: Hierarchies of number-theoretic functions. I. Arch. Math. Log.\u00a013(1), 39\u201351 (1970)","journal-title":"Arch. Math. Log."},{"key":"57_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11690634_15","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"key":"57_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11691372_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 411\u2013425. Springer, Heidelberg (2006)"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic over finite words. Log. Meth. Comput. Sci. 3(1) (2007)","DOI":"10.2168\/LMCS-3(1:8)2007"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Camb. Univ. Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"57_CR21","unstructured":"Schmitz, S.: Scientific report - ESF Short Visit to Oxford University (2012)"},{"key":"57_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P. Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 616\u2013628. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:09:37Z","timestamp":1558318177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}