{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:21Z","timestamp":1761610161741,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":4107,"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":[[2002,5]]},"DOI":"10.1016\/s1571-0661(04)80197-x","type":"journal-article","created":{"date-parts":[[2004,12,13]],"date-time":"2004-12-13T12:55:14Z","timestamp":1102942514000},"page":"127-138","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Basic Results for Two Types of High-Level Replacement Systems"],"prefix":"10.1016","volume":"51","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[]},{"given":"Annegret","family":"Habel","sequence":"additional","affiliation":[]},{"given":"F.","family":"Parisi-Presicce","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB1","series-title":"Handbook of Graph Grammars and Computing by Graph transformation, Volume 1: Foundations","first-page":"163","article-title":"Algebraic approaches to graph transformation Part I: Basic concepts and double pushout approach","author":"Corradini","year":"1997"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Ehrig H., Introduction to the algebraic theory of graph grammars, in: V. Claus, H. Ehrig and G. Rozenberg, editors, Lecture Notes in Computer Science 73, 1st Graph Grammar Workshop (1979), pp. 1\u201369.","DOI":"10.1007\/BFb0025714"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB3","series-title":"Handbook of Graph Grammars and Computing by Graph transformation, Volume 3: Concurrency, Parallelism, and Distribution","first-page":"341","article-title":"High-level replacement systems applied to algebraic specifications and petri nets","author":"Ehrig","year":"1999"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Ehrig H., A. Habel, H.-J. Kreowski and F. Parisi-Presicce, From graph grammars to high level replacement systems, in: Lecture Notes in Computer Science 532, 4th Int. Workshop on Graph Grammars and their Application to Computer Science (1991), pp. 269\u2013291.","DOI":"10.1007\/BFb0017395"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129500001353","article-title":"Parallelism and concurrency in high level replacement systems","volume":"1","author":"Ehrig","year":"1991","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Ehrig H., and H.-J. Kreowski, Parallelism of manipulations in multidimensional information structures, in: Lecture Notes in Computer Science 45, Mathematical Foundations of Computer Science (1976), pp. 284\u2013293.","DOI":"10.1007\/3-540-07854-1_188"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Ehrig H. and F. Parisi-Presicce, Algebraic specification grammars: a junction between module specifications and graph grammars, in: Lecture Notes in Computer Science 532, 4th Int. Workshop on Graph Grammars and their Application to Computer Science (1991), pp. 292\u2013310.","DOI":"10.1007\/BFb0017396"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB8","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129501003425","article-title":"Double-pushout graph transformation revisited","volume":"11","author":"Habel","year":"2001","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB9","unstructured":"Kreowski H.-J., Manipulationen von Graphmanipulationen, Dissertation, Technische Universit\u00e4t Berlin (1977)."},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","article-title":"Petri nets are monoids","volume":"88","author":"Meseguer","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80197-X_NEWBIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1017\/S0960129500000724","article-title":"Algebraic high-level net transformation systems","volume":"5","author":"Padberg","year":"1995","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480197X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480197X?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:04:58Z","timestamp":1761609898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610480197X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":11,"alternative-id":["S157106610480197X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80197-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Basic Results for Two Types of High-Level Replacement Systems","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(04)80197-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}