{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:21:59Z","timestamp":1742998919801,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540883869"},{"type":"electronic","value":"9783540883876"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88387-6_29","type":"book-chapter","created":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T01:42:45Z","timestamp":1223602965000},"page":"332-346","source":"Crossref","is-referenced-by-count":7,"title":["Tree Pattern Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Serre","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","first-page":"313","volume-title":"LICS 1996","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313\u2013321. IEEE Comp. Soc, Los Alamitos (1996)"},{"key":"29_CR2","first-page":"35","volume-title":"PODS 2004","author":"S. Abiteboul","year":"2004","unstructured":"Abiteboul, S., Benjelloun, O., Milo, T.: Positive Active XML. In: PODS 2004, pp. 35\u201345. ACM, New York (2004)"},{"key":"29_CR3","volume-title":"PODS 2008","author":"S. Abiteboul","year":"2008","unstructured":"Abiteboul, S., Segoufin, L., Vianu, V.: Analysis of Active XML Services. In: PODS 2008. ACM Press, New York (to appear, 2008)"},{"key":"29_CR4","unstructured":"Active XML, \n                    \n                      http:\/\/www.activexml.net\/"},{"key":"29_CR5","first-page":"205","volume-title":"LICS 2008","author":"P. Chambart","year":"2008","unstructured":"Chambart, P., Schnoebelen, P.: The Ordinal Recursive Complexity of Lossy Channel Systems. In: LICS 2008, pp. 205\u2013216. IEEE Comp. Soc., Los Alamitos (2008)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"R.\u00a0Diestel. Graph theory (2005), \n                    \n                      http:\/\/www.math.uni-hamburg.de\/home\/diestel","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"29_CR8","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."},{"key":"29_CR9","unstructured":"Genest, B., Muscholl, A., Serre, O., Zeitoun, M.: Tree Pattern Rewrite Systems. Internal report, \n                    \n                      http:\/\/www.crans.org\/~genest\/GMSZ08.pdf"},{"key":"29_CR10","volume-title":"Handbook of Automated Reasoning, ch. 9","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Plaisted, D.: In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 9, vol.\u00a01. Elsevier, Amsterdam (2001)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Libkin, L.: Logics over unranked trees: an overview. Logical Methods in Computer Science\u00a02(3) (2006)","DOI":"10.2168\/LMCS-2(3:2)2006"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74456-6_8","volume-title":"Mathematical Foundations of Computer Science 2007","author":"C.. L\u00f6ding","year":"2007","unstructured":"L\u00f6ding, C., Spelten, A.: Transition Graphs of Rewriting Systems over Unranked Trees. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 67\u201377. Springer, Heidelberg (2007)"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"Computer Science Logic","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, Logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"issue":"5","key":"29_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P.. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Inf. Process. Lett.\u00a083(5), 251\u2013261 (2002)","journal-title":"Inf. Process. Lett."},{"key":"#cr-split#-29_CR15.1","doi-asserted-by":"crossref","unstructured":"Walukiewicz, I.: Difficult Configurations-on the Complexity of LTrL. ICALP 1998\u00a026(1), 27-43 (2005)","DOI":"10.1007\/s10703-005-4593-z"},{"key":"#cr-split#-29_CR15.2","unstructured":"In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 27-43. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88387-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:35:22Z","timestamp":1558265722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88387-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540883869","9783540883876"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88387-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}