{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:07Z","timestamp":1725566287197},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232070"},{"type":"electronic","value":"9783540302032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30203-2_21","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T18:59:27Z","timestamp":1285095567000},"page":"287-303","source":"Crossref","is-referenced-by-count":23,"title":["Constraints and Application Conditions: From Graphs to High-Level Structures"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[]},{"given":"Karsten","family":"Ehrig","sequence":"additional","affiliation":[]},{"given":"Annegret","family":"Habel","sequence":"additional","affiliation":[]},{"given":"Karl-Heinz","family":"Pennemann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/3-540-40011-7_21","volume-title":"UML 2000 - The Unified Modeling Language. Advancing the Standard","author":"P. Bottoni","year":"2000","unstructured":"Bottoni, P., Koch, M., Parisi-Presicce, M., Taentzer, G.: Consistency checking and visualization of ocl constraints. In: Evans, A., Kent, S., Selic, B. (eds.) UML 2000. LNCS, vol.\u00a01939, pp. 294\u2013308. Springer, Heidelberg (2000)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation. Part I: Basic concepts and double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, ch. 3, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025714","volume-title":"Graph-Grammars and Their Application to Computer Science and Biology","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol.\u00a073, pp. 1\u201369. Springer, Heidelberg (1979)"},{"key":"21_CR4","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":"21_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001353","volume":"1","author":"H. Ehrig","year":"1991","unstructured":"Ehrig, H., Habel, A., Kreowski, H.-J., Presicce, F.P.: Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science\u00a01, 361\u2013404 (1991)","journal-title":"Mathematical Structures in Computer Science"},{"key":"21_CR6","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":"21_CR7","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":"21_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. Fundamenta Informaticae\u00a026, 287\u2013313 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Heckel, R., Wagner, A.: Ensuring consistency of conditional graph grammars \u2014 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"},{"key":"21_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":"21_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":"21_CR12","first-page":"201","volume-title":"Term Graph Rewriting: Theory and Practice","author":"D. Plump","year":"1993","unstructured":"Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Term Graph Rewriting: Theory and Practice, pp. 201\u2013213. John Wiley, New York (1993)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30203-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:46Z","timestamp":1620014086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30203-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232070","9783540302032"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30203-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}