{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:03:07Z","timestamp":1776304987610,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433668","type":"print"},{"value":"9783540459316","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_20","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"280-294","source":"Crossref","is-referenced-by-count":6,"title":["Model-Checking Infinite Systems Generated by Ground Tree Rewriting"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Achim Blumensath and Erich Gr\u00e4del. Automatic structures. In Proceedings of LICS\u2019 00, pages 51\u201362. IEEE Computer Society Press, 2000.","DOI":"10.1109\/LICS.2000.855755"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W. S. Brainerd","year":"1969","unstructured":"Walter S. Brainerd. Tree generating regular systems. Information and Control, 14:217\u2013231, 1969.","journal-title":"Information and Control"},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings ICALP\u2019 96","author":"D. Caucal","year":"1996","unstructured":"Didier Caucal. On infinite transition graphs having a decidable monadic theory. In Proceedings ICALP\u2019 96, volume 1099 of LNCS. Springer-Verlag, 1996."},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)90101-5","volume":"127","author":"J.L. Coquid\u00e9","year":"1994","unstructured":"J.L. Coquid\u00e9, M. Dauchet, R. Gilleron, and S. V\u00e1gv\u00f6lgyi. Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Theoretical Computer Science, 127(1):69\u201398, 1994.","journal-title":"Theoretical Computer Science"},{"key":"20_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-53414-8_34","volume-title":"Aspects and Prospects of Theoretical Computer Science","author":"J.L. Coquid\u00e9","year":"1990","unstructured":"J.L. Coquid\u00e9 and R. Gilleron. Proofs and reachability problem for ground rewrite systems. In Aspects and Prospects of Theoretical Computer Science, volume 464 of LNCS, pages 120\u2013129. Springer, 1990."},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0890-5401(90)90015-A","volume":"88","author":"M. Dauchet","year":"1990","unstructured":"Max Dauchet, Thierry Heuillard, Pierre Lescanne, and Sophie Tison. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation, 88(2):187\u2013201, October 1990.","journal-title":"Information and Computation"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Max Dauchet and Sophie Tison. The theory of ground rewrite systems is decidable. In Proceedings LICS\u2019 90, pages 242\u2013248. IEEE Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113750"},{"key":"20_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Proceedings of CAV 2000","author":"J. Esparza","year":"2000","unstructured":"Javier Esparza, David Hansel, Peter Rossmanith, and Stefan Schwoon. Efficient algorithms for model checking pushdown systems. In Proceedings of CAV 2000, volume 1855 of LNCS, pages 232\u2013247. Springer-Verlag, 2000."},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-60045-0_62","volume-title":"Proceedings of CAV\u2019 95","author":"J. Esparza","year":"1995","unstructured":"Javier Esparza and Astrid Kiehn. On the model checking problem for branching time logics and Basic Parallel Processes. In Proceedings of CAV\u2019 95, volume 939 of LNCS, pages 353\u2013366, 1995."},{"key":"20_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CAV 2000","author":"O. Kupferman","year":"2000","unstructured":"Orna Kupferman and Moshe Y. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In E. A. Emerson and A. P. Sistla, editors, Proceedings of CAV 2000, volume 1855 of LNCS. Springer-Verlag, 2000."},{"issue":"1\u20132","key":"20_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Richard Mayr. Process rewrite systems. Information and Computation, 156(1\u20132):264\u2013286, 2000.","journal-title":"Information and Computation"},{"key":"20_CR12","series-title":"Lect Notes Comput Sci","first-page":"252","volume-title":"Proceedings of FoSSaCS\u2019 99","author":"C. Morvan","year":"1999","unstructured":"Christophe Morvan. On rational graphs. In Proceedings of FoSSaCS\u2019 99, volume 1784 of LNCS, pages 252\u2013266. Springer, 1999."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. E. Muller","year":"1985","unstructured":"David E. Muller and Paul E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51\u201375, 1985.","journal-title":"Theoretical Computer Science"},{"key":"20_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-61474-5_58","volume-title":"Proceedings of CAV\u2019 96","author":"I. Walukiewicz","year":"1996","unstructured":"Igor Walukiewicz. Pushdown processes: Games and model checking. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of CAV\u2019 96, volume 1102 of LNCS, pages 62\u201374. Springer-Verlag, July\u2013August 1996."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:19:54Z","timestamp":1737087594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}