{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:21Z","timestamp":1760202681307,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319114385"},{"type":"electronic","value":"9783319114392"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11439-2_6","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:30:11Z","timestamp":1410744611000},"page":"72-84","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[]},{"given":"Jan","family":"St\u00fcckrath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-38592-6_14","volume-title":"Formal Techniques for Distributed Systems","author":"P.A. Abdulla","year":"2013","unstructured":"Abdulla, P.A., Atig, M.F., Rezine, O.: Verification of directed acyclic ad hoc networks. In: Beyer, D., Boreale, M. (eds.) FORTE 2013 and FMOODS 2013. LNCS, vol.\u00a07892, pp. 193\u2013208. Springer, Heidelberg (2013)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0129054113400078","volume":"24","author":"P.A. Abdulla","year":"2013","unstructured":"Abdulla, P.A., Cederberg, J., Vojnar, T.: Monotonic abstraction for programs with multiply-linked structures. Int. J. Found. Comput. Sci.\u00a024(2), 187\u2013210 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s10703-008-0062-9","volume":"34","author":"P.A. Abdulla","year":"2009","unstructured":"Abdulla, P.A., Delzanno, G., Rezine, A.: Approximated parameterized verification of infinite-state processes with global conditions. Formal Methods in System Design\u00a034(2), 126\u2013156 (2009)","journal-title":"Formal Methods in System Design"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Delzanno, G., Rezine, A.: Automatic verification of directory-based consistency protocols with graph constraints. Int. J. Found. Comput. Sci.\u00a022(4) (2011)","DOI":"10.1142\/S0129054111008416"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-78163-9_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Ben Henda, N., Delzanno, G., Rezine, A.: Handling parameterized systems with non-atomic global conditions. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 22\u201336. Springer, Heidelberg (2008)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: Proc. of LICS 1996, pp. 313\u2013321. IEEE (1996)","DOI":"10.1109\/LICS.1996.561359"},{"key":"6_CR7","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: RTA 2012. LIPIcs, vol.\u00a015, pp. 101\u2013116. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"6_CR8","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: RTA, pp. 101\u2013116 (2012)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0022-0000(87)90030-4","volume":"34","author":"P. Boehm","year":"1987","unstructured":"Boehm, P., Fonio, H., Habel, A.: Amalgamation of graph transformations: A synchronization mechanism. Journal of Computer and System Sciences\u00a034, 377\u2013408 (1987)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-03845-7_11","volume-title":"Computational Methods in Systems Biology","author":"G. Delzanno","year":"2009","unstructured":"Delzanno, G., Di Giusto, C., Gabbrielli, M., Laneve, C., Zavattaro, G.: The \u03ba-lattice: Decidability boundaries for qualitative analysis in biological languages. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol.\u00a05688, pp. 158\u2013172. Springer, Heidelberg (2009)"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10009-011-0213-y","volume":"14","author":"G. Delzanno","year":"2012","unstructured":"Delzanno, G., Rezine, A.: A lightweight regular model checking approach for parameterized systems. STTT\u00a014(2), 207\u2013222 (2012)","journal-title":"STTT"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-41036-9_11","volume-title":"Reachability Problems","author":"G. Delzanno","year":"2013","unstructured":"Delzanno, G., Sangnier, A., Traverso, R.: Parameterized verification of broadcast networks of register automata. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol.\u00a08169, pp. 109\u2013121. Springer, Heidelberg (2013)"},{"key":"6_CR13","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in reconfigurable broadcast networks. In: FSTTCS 2012. LIPIcs, vol.\u00a018, pp. 289\u2013300. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G. Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 313\u2013327. Springer, Heidelberg (2010)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G. Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 313\u2013327. Springer, Heidelberg (2010)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-19805-2_30","volume-title":"Foundations of Software Science and Computational Structures","author":"G. Delzanno","year":"2011","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: On the power of cliques in the parameterized verification of ad hoc networks. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 441\u2013455. Springer, Heidelberg (2011)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Delzanno, G., Stu whole neighbourhood operations, arXiv:1407.4394 (2014)\u0308ckrath, J.: Parameterized verification of graph transformation systems with whole neighbourhood operations, arXiv:1407.4394 (2014)","DOI":"10.1007\/978-3-319-11439-2_6"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-37064-9_22","volume-title":"Language and Automata Theory and Applications","author":"G. Delzanno","year":"2013","unstructured":"Delzanno, G., Traverso, R.: Decidability and complexity results for verification of asynchronous broadcast networks. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol.\u00a07810, pp. 238\u2013249. Springer, Heidelberg (2013)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/jgt.3190160509","volume":"16","author":"G. Ding","year":"1992","unstructured":"Ding, G.: Subgraphs and well-quasi-ordering. Jornal of Graph Theory\u00a016, 489\u2013502 (1992)","journal-title":"Jornal of Graph Theory"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/11841883_7","volume-title":"Graph Transformations","author":"F. Drewes","year":"2006","unstructured":"Drewes, F., Hoffmann, B., Janssens, D., Minas, M., Van Eetvelde, N.: Adaptive star grammars. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 77\u201391. Springer, Heidelberg (2006)"},{"key":"6_CR21","doi-asserted-by":"crossref","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: Foundations. ch. 4, vol.\u00a01. World Scientific (1997)","DOI":"10.1142\/9789812384720_0004"},{"issue":"1-2","key":"6_CR22","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-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"6_CR23","unstructured":"Heum\u00fcller, M., Joshi, S., K\u00f6nig, B., St\u00fcckrath, J.: Construction of pushout complements in the category of hypergraphs. In: Proc. of GCM 2010 (Workshop on Graph Computation Models) (2010)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-662-44584-6_32","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"B. K\u00f6nig","year":"2014","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: A general framework for well-structured graph transformation systems. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol.\u00a08704, pp. 467\u2013481. Springer, Heidelberg (2014)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-35873-9_29","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K.S. Namjoshi","year":"2013","unstructured":"Namjoshi, K.S., Trefler, R.J.: Uncovering symmetries in irregular process networks. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol.\u00a07737, pp. 496\u2013514. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11439-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:32:43Z","timestamp":1746376363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11439-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114385","9783319114392"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11439-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}