{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:38Z","timestamp":1760202578487},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705437"},{"type":"electronic","value":"9783540705451"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70545-1_21","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"214-226","source":"Crossref","is-referenced-by-count":18,"title":["Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems"],"prefix":"10.1007","author":[{"given":"Salil","family":"Joshi","sequence":"first","affiliation":[]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BFb0028760","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"1998","unstructured":"Abdulla, P.A., Jonsson, B., Kindahl, M., Peled, D.: A general approach to partial order reductions in symbolic verification. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 379\u2013390. Springer, Heidelberg (1998)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-44685-0_26","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A static analysis technique for graph transformation systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 381\u2013395. Springer, Heidelberg (2001)"},{"key":"21_CR3","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, ch. 4","author":"H. Ehrig","year":"1997","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u00f6we, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation\u2014part\u00a0II: Single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, ch. 4, vol.\u00a01: Foundations, World Scientific, Singapore (1997)"},{"issue":"1\u20132","key":"21_CR4","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! Theoretical Computer Science\u00a0256(1\u20132), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M. L\u00f6we","year":"1993","unstructured":"L\u00f6we, M.: Algebraic approach to single-pushout graph transformation. Theoretical Computer Science\u00a0109, 181\u2013224 (1993)","journal-title":"Theoretical Computer Science"},{"key":"21_CR6","unstructured":"Rensink, A., Distefano, D.: Abstract graph transformation. In: Proc. of SVV 2005 (3rd International Workshop on Software Verification and Validation). ENTCS, vol.\u00a0157.1, pp. 39\u201359 (2005)"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.: Graph minors. XX. Wagner\u2019s conjecture. Journal of Combinatorial Theory, Series B\u00a092(2), 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"21_CR8","unstructured":"Robertson, N., Seymour, P.: Graph minors. XXIII. Nash-Williams\u2019 immersion conjecture (2006) (submitted for publication), \n                    \n                      http:\/\/www.math.princeton.edu\/~pds\/papers\/GM23\/GM23.pdf"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-540-78800-3_3","volume-title":"Proc. of TACAS 2008","author":"M. Saksena","year":"2008","unstructured":"Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of ad hoc routing protocols. In: Proc. of TACAS 2008. LNCS, vol.\u00a04963, pp. 18\u201332. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70545-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:21:56Z","timestamp":1620015716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70545-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705437","9783540705451"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70545-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}