{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:59:06Z","timestamp":1794383946965,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540249368","type":"print"},{"value":"9783540318477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31847-7_17","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T14:51:47Z","timestamp":1294411907000},"page":"293-308","source":"Crossref","is-referenced-by-count":31,"title":["Nested Constraints and Application Conditions for High-Level Structures"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl-Heinz","family":"Pennemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-30203-2_21","volume-title":"Graph Transformations","author":"H. Ehrig","year":"2004","unstructured":"Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.-H.: Constraints and application conditions: From graphs to high-level structures. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 287\u2013303. Springer, Heidelberg (2004)"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-642-95486-3_7","volume-title":"The Book of L","author":"H. Ehrig","year":"1986","unstructured":"Ehrig, H., Habel, A.: Graph grammars with application conditions. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 87\u2013100. Springer, Berlin (1986)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-30203-2_12","volume-title":"Graph Transformations","author":"H. Ehrig","year":"2004","unstructured":"Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive highlevel replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 144\u2013160. Springer, Heidelberg (2004)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30203-2_13","volume-title":"Graph Transformations","author":"H. Ehrig","year":"2004","unstructured":"Ehrig, H., Prange, U., Taentzer, G.: Fundamental theory of typed attributed graph transformation. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 161\u2013177. Springer, Heidelberg (2004)"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1142\/9789812815149_0014","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"C. Ermel","year":"1999","unstructured":"Ermel, C., Rudolf, M., Taentzer, G.: The AGG approach: Language and environment. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, pp. 551\u2013603. World Scientific, Singapore (1999)"},{"key":"17_CR6","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. Fundamenta Informaticae\u00a026, 287\u2013313 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1017\/S0960129501003425","volume":"11","author":"A. Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science\u00a011(5), 637\u2013688 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars \u2013 a constructive approach. In: SEGRAGRA 1995. Electronic Notes in Theoretical Computer Science, vol.\u00a02, pp. 95\u2013104 (1995)","DOI":"10.1016\/S1571-0661(05)80188-4"},{"issue":"1-3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Information and Control\u00a068(1-3), 86\u2013104 (1986)","journal-title":"Information and Control"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45832-8_18","volume-title":"Graph Transformation","author":"M. Koch","year":"2002","unstructured":"Koch, M., Parisi-Presicce, F.: Describing policies with graph constraints and rules. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 223\u2013238. Springer, Heidelberg (2002)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 273\u2013288. Springer, Heidelberg (2004)"},{"key":"17_CR12","first-page":"165","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Mahr","year":"1982","unstructured":"Mahr, B., Wilharm, A.: Graph grammars as a tool for description in computer processed control: A case study. In: Graph-Theoretic Concepts in Computer Science, pp. 165\u2013176. Hanser Verlag, M\u00fcnchen (1982)"},{"key":"17_CR13","unstructured":"Mosbah, M., Ossamy, R.: A programming language for local computations in graphs: Logical basis. Technical report, University of Bordeaux (2003)"},{"key":"17_CR14","unstructured":"Pennemann, K.-H.: Generalized constraints and application conditions for graph transformation systems. Master\u2019s thesis, University of Oldenburg (2004)"},{"key":"17_CR15","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 by graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 319\u2013335. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Software and Systems Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31847-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:28:29Z","timestamp":1605742109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31847-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249368","9783540318477"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31847-7_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b106390","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}