{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:47:12Z","timestamp":1762458432525,"version":"build-2065373602"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(05)80188-4","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"118-126","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":77,"special_numbering":"C","title":["Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach -"],"prefix":"10.1016","volume":"2","author":[{"given":"Reiko","family":"Heckel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annika","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80188-4_BIB1","unstructured":"M. Conrad, M. Gajewsky, R. Holl-Biniasz, M. Rudolf, J. Demuth, S. Weber, r. Heckel, M\u00fcller J., G. Taentzer, and A. Wagner. Graphische Spezifikation ausgew\u00e4hlter Teile von AGG - einem algebraischen Graphgrammatiksystem. Techn. Report 95\u20137, TU-Berlin, 1995. students project report."},{"key":"10.1016\/S1571-0661(05)80188-4_BIB2","doi-asserted-by":"crossref","unstructured":"B. Courcelle. The monadic second-order logic of graphs I, recognizable sets of finite graphs. Information and Computation, 85 (1990) 12\u201375","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB3","series-title":"The Book of L","first-page":"87","article-title":"Graph grammars with application conditions","author":"Ehrig","year":"1985"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB4","series-title":"1st Graph Grammar Workshop, Lecture Notes in Computer Science 13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0025714","article-title":"Introduction to the algebraic theory of graph grammars","author":"Ehrig","year":"1979"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB5","doi-asserted-by":"crossref","unstructured":"A. Habel, R. Heckel, and G. Taentzer. Graph grammars with negative application conditions, accepted for special issue of Fundamenta Informaticae, 1995.","DOI":"10.3233\/FI-1996-263404"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB6","unstructured":"H.-J. Kreowski and S. Kuske. On the interleaving semantics of transformation units - a step into GRACE, submitted to proceedings of Graph Grammar Workshop in Williamsburg, 1994."},{"key":"10.1016\/S1571-0661(05)80188-4_BIB7","doi-asserted-by":"crossref","unstructured":"M. Korff. Single pushout transformations of equationally defined graph structures with applications to actor systems. In Proc. Graph Grammar Workshop Dagstuhl 93, pages 234\u2013247, 1994. Lecture Notes in Computer Science 776.","DOI":"10.1007\/3-540-57787-4_15"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","article-title":"Algebraic approach to single-pushout graph transformation","volume":"109","author":"L\u00f6we","year":"1993","journal-title":"TCS"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(70)90135-X","article-title":"Separable graphs, planar graphs and web grammars","volume":"16","author":"Montanari","year":"1970","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB10","first-page":"609","article-title":"Web grammars","author":"Pfaltz","year":"1969","journal-title":"Int. Joint Confenence on Artificial Intelligence"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB11","series-title":"LNCS532.","article-title":"Progress: A vhl-language based on graph grammars","author":"Sch\u00fcrr","year":"1991"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB12","series-title":"Graph Transformations in Computer Science.","article-title":"Logic based structure rewriting systems","author":"Sch\u00fcrr","year":"1994"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1080\/00207168408803400","article-title":"Node-label controlled graph grammars with context conditions","volume":"15","author":"von Solms","year":"1984","journal-title":"Intern. J. Computer Math"},{"key":"10.1016\/S1571-0661(05)80188-4_BIB14","series-title":"TAPSOFT\/CAAP","article-title":"On the expressive power of graph grammars with application conditions","author":"Wagner","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801884?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801884?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:56Z","timestamp":1761610076000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":14,"alternative-id":["S1571066105801884"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80188-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach -","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80188-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}