{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T12:34:42Z","timestamp":1789994082272,"version":"4.0.1"},"reference-count":29,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"unspecified","delay-in-days":6333,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1991,11]]},"abstract":"<jats:p>High-level replacement systems are formulated in an axiomatic algebraic framework based on categories pushouts. This approach generalizes the well-known algebraic approach to graph grammars and several other types of replacement systems, especially the replacement of algebraic specifications which was recently introduced for a rule-based approach to modular system design.<\/jats:p><jats:p>in this paper basic notions like productions, derivations, parellel and sequential independence are introduced for high-level replacement syetms leading to Church-Rosser, Parallelism and concurrency Theorems previously shown in the literature for special cases only. In the general case of high-level replacement systems specific conditions, called HLR1- and HLR2-conditions, are formulated in order to obtain these results.<\/jats:p><jats:p>Several examples of high-level replacement systems are discussed and classified w.r.t. HLR1- and HLR2-conditions showing which of the results are valid in each case.<\/jats:p>","DOI":"10.1017\/s0960129500001353","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T09:03:00Z","timestamp":1236157380000},"page":"361-404","source":"Crossref","is-referenced-by-count":101,"title":["Parallelism and concurrency in high-level replacement systems"],"prefix":"10.1017","volume":"1","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Annegret","family":"Habel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Parisi-Presicce","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"S0960129500001353_ref028","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18771-5_72"},{"key":"S0960129500001353_ref027","unstructured":"Parisi-Presicce F. and Ehrig H. (1991) Algebraic specification grammars. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, on appear."},{"key":"S0960129500001353_ref025","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035788"},{"key":"S0960129500001353_ref024","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1988.5114","article-title":"Petri nets are monoids: a new algebraic foundation for net theory","volume":"88","author":"Meseguer","year":"1988","journal-title":"Proc. Logics in Comp. Sci."},{"key":"S0960129500001353_ref022","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08442-8_94"},{"key":"S0960129500001353_ref020","unstructured":"Kennaway R. (1991) Graph rewriting in some categories of partial morphisms. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear."},{"key":"S0960129500001353_ref019","volume-title":"Category Theory","author":"Herrlich","year":"1973"},{"key":"S0960129500001353_ref018","unstructured":"Hummert U. (1989) Algebraische Theorie von High-Level-Netzen. PhD Thesis, TU Berlin."},{"key":"S0960129500001353_ref017","unstructured":"Habel A. (1989) Hyperedge replacement: grammars and languages. PhD Thesis, University of Bremen. To appear in Springer Lecture Notes in Computer Science."},{"key":"S0960129500001353_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90016-X"},{"key":"S0960129500001353_ref014","article-title":"Graph grammars and their application to computer science. Proc. 2nd Int. Workshop on Graph Grammars","volume":"291","author":"Ehrig","year":"1987","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"S0960129500001353_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/BF01752403"},{"key":"S0960129500001353_ref010","doi-asserted-by":"crossref","unstructured":"Ehrig H. , Kreowski H.-J. and Rozenberg G. (1991b) Graph grammars and their applications to computer science. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear.","DOI":"10.1007\/BFb0017372"},{"key":"S0960129500001353_ref009","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19790910111"},{"key":"S0960129500001353_ref007","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1986-9103","article-title":"Concurrent transformations of relational structures","volume":"IX","author":"Ehrig","year":"1986","journal-title":"Fundamenta Informaticae"},{"key":"S0960129500001353_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0025714"},{"key":"S0960129500001353_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0025713"},{"key":"S0960129500001353_ref001","volume-title":"Arrows, Structures and Functors","author":"Arbib","year":"1975"},{"key":"S0960129500001353_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53982-4_16"},{"key":"S0960129500001353_ref023","volume-title":"Categories for the Working Mathematician","author":"MacLane","year":"1972"},{"key":"S0960129500001353_ref026","unstructured":"Parisi-Presicce F. (1990) A rule based approach to modular system design. Proc. 12th Int. Conf. Software Engineering."},{"key":"S0960129500001353_ref006","unstructured":"Ehrig H. , Habel A. , Kreowski H.-J. and Parisi-Presicce F. (1991a) From graph grammars to high level replacement systems. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear."},{"key":"S0960129500001353_ref012","article-title":"Fundamentals of algebraic specification 1. Equations and intial semantics","volume":"6","author":"Ehrig","year":"1985","journal-title":"Springer EATCS Monographs on Theoretical Computer Science"},{"key":"S0960129500001353_ref008","unstructured":"Ehrig H. and Kreowski H.-J. (1975) Categorical theory of graph grammars. Techn. Report TU Berlin, FB 20, Bericht Nr. 75-50."},{"key":"S0960129500001353_ref013","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0000094"},{"key":"S0960129500001353_ref016","doi-asserted-by":"crossref","unstructured":"Ehrig H. , Pfender M. and Schneider H. J. (1973) Graph grammars: an algebraic approach. Proc. IEEE Conf. SWAT73, Iowa City pp 167\u2013180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"S0960129500001353_ref029","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288659"},{"key":"S0960129500001353_ref003","unstructured":"Corradini A. , Montanari U. , Rossi F. , Ehrig H. and L\u00f6we M. (1991a) Graph grammars and logic programming. Proc. 4th Int. Workshop on Graph Grammars. Springer Lecture Notes in Computer Science, to appear"},{"key":"S0960129500001353_ref021","unstructured":"Kreowski H.-J. (1977a) Manipulation von Graphmanipulationen, PhD Thesis, TU Berlin."}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500001353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,2]],"date-time":"2021-10-02T16:34:53Z","timestamp":1633192493000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500001353\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["S0960129500001353"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500001353","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}