{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:47Z","timestamp":1760202647616,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336539"},{"type":"electronic","value":"9783642336546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_6","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T03:47:41Z","timestamp":1347940061000},"page":"81-95","source":"Crossref","is-referenced-by-count":4,"title":["Well-Structured Graph Transformation Systems with Negative Application Conditions"],"prefix":"10.1007","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[]},{"given":"Jan","family":"St\u00fcckrath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: 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_CR2","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: Proc. of RTA 2012. LIPIcs. Schloss Dagstuhl \u2013 Leibniz Center for Informatics (2012)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-49116-3_30","volume-title":"STACS 99","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Mayr, R.: Model Checking Lossy Vector Addition Systems. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 323\u2013333. Springer, Heidelberg (1999)"},{"key":"6_CR4","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer (2006)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets. Technical Report RS-94-8, BRICS (May 1994)","DOI":"10.7146\/brics.v1i8.21662"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-11269-0_12","volume-title":"Parameterized and Exact Computation","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A.: Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 149\u2013160. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"6_CR7","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"},{"issue":"3-4","key":"6_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A. Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundam. Inf.\u00a026(3-4), 287\u2013313 (1996)","journal-title":"Fundam. Inf."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-31847-7_17","volume-title":"Formal Methods in Software and Systems Modeling","author":"A. Habel","year":"2005","unstructured":"Habel, A., Pennemann, K.-H.: Nested Constraints and Application Conditions for High-Level Structures. In: Kreowski, H.-J., Montanari, U., Yu, Y., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol.\u00a03393, pp. 293\u2013308. Springer, Heidelberg (2005)"},{"key":"6_CR10","unstructured":"Joshi, S., K\u00f6nig, B.: Applying the graph minor theorem to the verification of graph transformation systems. Technical Report 2012-01, Abteilung f\u00fcr Informatik und Angewandte Kognitionswissenschaft, Universit\u00e4t Duisburg-Essen (2012)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70545-1_21","volume-title":"Computer Aided Verification","author":"S. Joshi","year":"2008","unstructured":"Joshi, S., K\u00f6nig, B.: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 214\u2013226. Springer, Heidelberg (2008)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: Well-structured graph transformation systems with negative application conditions. Technical Report 2012-03, Abteilung f\u00fcr Informatik und Angewandte Kognitionswissenschaft, Universit\u00e4t Duisburg-Essen (2012)","DOI":"10.1007\/978-3-642-33654-6_6"},{"key":"6_CR13","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":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A. Rensink","year":"2004","unstructured":"Rensink, A.: Representing First-Order Logic Using Graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 319\u2013335. Springer, Heidelberg (2004)"},{"key":"6_CR15","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, 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jctb.2009.07.003","volume":"100","author":"N. Robertson","year":"2010","unstructured":"Robertson, N., Seymour, P.: Graph minors XXIII. Nash-Williams\u2019 immersion conjecture. Journal of Combinatorial Theory Series B\u00a0100, 181\u2013205 (2010)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a01. World Scientific (1997)","DOI":"10.1142\/9789812384720"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T23:34:35Z","timestamp":1744155275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}