{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:34Z","timestamp":1776333454602,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642120312","type":"print"},{"value":"9783642120329","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_16","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"221-236","source":"Crossref","is-referenced-by-count":18,"title":["Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems"],"prefix":"10.1007","author":[{"given":"Anthony Widjaja","family":"To","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput.\u00a0127(2), 91\u2013101 (1996)","journal-title":"Inf. Comput."},{"key":"16_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":"16_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. TCS\u00a0126, 183\u2013235 (1994)","journal-title":"TCS"},{"key":"16_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11916277_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C. Baier","year":"2006","unstructured":"Baier, C., Bertrand, N., Schnoebelen, P.: On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 347\u2013361. Springer, Heidelberg (2006)"},{"key":"16_CR5","unstructured":"Barany, V.: Automatic Presentations of Infinite Structures. PhD Thesis, RWTH Aachen (2007)"},{"issue":"5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10009-008-0064-3","volume":"10","author":"S. Bardin","year":"2008","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: acceleration from theory to practice. STTT\u00a010(5), 401\u2013424 (2008)","journal-title":"STTT"},{"issue":"6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: automata and interpretations. Theory Comput. Syst.\u00a037(6), 641\u2013674 (2004)","journal-title":"Theory Comput. Syst."},{"key":"16_CR8","unstructured":"Bouajjani, A., Legay, A., Wolper, P.: A Framework to Handle Linear Temporal Properties in (\u03c9)Regular Model Checking CoRR abs\/0901.4080 (2009)"},{"key":"16_CR9","volume-title":"Handbook of Process Algebra","author":"O. Burkart","year":"1999","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra. Elsevier, Amsterdam (1999)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. TCS\u00a0106, 61\u201386 (1992)","journal-title":"TCS"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"H. Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 268\u2013279. Springer, Heidelberg (1998)"},{"key":"16_CR12","unstructured":"Comon, H., et al.: Tree Automata: Techniques and Applications (2007), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/10722167_9","volume-title":"Computer Aided Verification","author":"Z. Dang","year":"2000","unstructured":"Dang, Z., Ibarra, O., Bultan, T., Kemmerer, R., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 69\u201384. Springer, Heidelberg (2000)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-45294-X_12","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"Z. Dang","year":"2001","unstructured":"Dang, Z., Ibarra, O., Pietro, P.S.: Liveness verification of reversal-bounded multicounter machines with a free counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 132\u2013143. Springer, Heidelberg (2001)"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C. Elgot","year":"1965","unstructured":"Elgot, C., Mezei, J.: On relations defined by generalized finite automata. IBM J.\u00a0Res.\u00a0Develop.\u00a09, 47\u201368 (1965)","journal-title":"IBM J.\u00a0Res.\u00a0Develop."},{"issue":"1","key":"16_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. Fundam. Inform.\u00a031(1), 13\u201325 (1997)","journal-title":"Fundam. Inform."},{"issue":"1-2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","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":"Theor. Comput. Sci."},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2008.04.008","volume":"108","author":"S. G\u00f6ller","year":"2008","unstructured":"G\u00f6ller, S.: Reachability on prefix-recognizable graphs. Inf. Process. Lett.\u00a0108(2), 71\u201374 (2008)","journal-title":"Inf. Process. Lett."},{"key":"16_CR19","unstructured":"Grohe, M.: Logic, graphs, and algorithms. In: Logic and Automata - History and Perspectives, pp. 357\u2013422. Amsterdam University Press (2007)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Hague, M., Ong, C.-H.L.: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. LMCS\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:14)2008"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0304-3975(01)00268-7","volume":"289","author":"O. Ibarra","year":"2002","unstructured":"Ibarra, O., Su, J., Dang, Z., Bultan, T., Kemmerer, R.: Counter machines and verification problems. Theor. Comput. Sci.\u00a0289, 165\u2013189 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45657-0_31","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2002","unstructured":"Kupferman, O., Piterman, N., Vardi, M.: Model checking linear properties of prefix-recognizable systems. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 371\u2013385. Springer, Heidelberg (2002)"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-78800-3_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Lal","year":"2008","unstructured":"Lal, A., Touili, T., Kidd, N., Reps, T.: Interprocedural Analysis of Concurrent Programs Under a Context Bound. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 282\u2013298. Springer, Heidelberg (2008)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11562948_36","volume-title":"Automated Technology for Verification and Analysis","author":"J. Leroux","year":"2005","unstructured":"Leroux, J., Sutre, G.: Flat Counter Automata Almost Everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 489\u2013503. Springer, Heidelberg (2005)"},{"key":"16_CR25","unstructured":"L\u00f6ding, C.: Infinite Graphs Generated by Tree Rewriting, PhD thesis, RWTH Aachen (2003)"},{"issue":"1","key":"16_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ic.2005.02.003","volume":"203","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D., Schnoebelen, P.: Decidable first-order transition logics for PA-processes. Inf. Comput.\u00a0203(1), 75\u2013113 (2005)","journal-title":"Inf. Comput."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Maidl, M.: The Common Fragment of CTL and LTL. In: FOCS 2000, pp. 643\u2013652 (2000)","DOI":"10.1109\/SFCS.2000.892332"},{"key":"16_CR28","unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, TU-Munich (1998)"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Morvan, C.: On rational graphs. In: FOSSACS 2000, pp. 252\u2013266 (2000)","DOI":"10.1007\/3-540-46432-8_17"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","first-page":"242","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-Bounded Model Checking of Concurrent Software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 242\u2013254. Springer, Heidelberg (2005)"},{"key":"16_CR31","unstructured":"Rehak, V.: On Extensions of Process Rewrite Systems, PhD thesis, Masaryk University (2007)"},{"issue":"3","key":"16_CR32","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The Complexity of Propositional Linear Temporal Logics. J. ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"J. ACM"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-540-45138-9_6","volume-title":"Mathematical Foundations of Computer Science 2003","author":"W. Thomas","year":"2003","unstructured":"Thomas, W.: Constructing infinite graphs with a decidable MSO-theory. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 113\u2013124. Springer, Heidelberg (2003)"},{"key":"16_CR34","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-89439-1_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A.W. To","year":"2008","unstructured":"To, A.W., Libkin, L.: Recurrent reachability analysis in regular model checking. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 198\u2013213. Springer, Heidelberg (2008)"},{"issue":"2","key":"16_CR35","first-page":"183","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. JCSS\u00a032(2), 183\u2013221 (1986)","journal-title":"JCSS"},{"key":"16_CR36","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/11532231_25","volume-title":"Automated Deduction \u2013 CADE-20","author":"K.N. Verma","year":"2005","unstructured":"Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational Horn clauses. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 337\u2013352. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T01:38:59Z","timestamp":1739929139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}