{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:16:29Z","timestamp":1762175789937},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Categor Struct"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf00872984","type":"journal-article","created":{"date-parts":[[2004,12,24]],"date-time":"2004-12-24T20:34:32Z","timestamp":1103920472000},"page":"21-50","source":"Crossref","is-referenced-by-count":15,"title":["Categorical principles, techniques and results for high-level-replacement systems in computer science"],"prefix":"10.1007","volume":"1","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[]},{"given":"Michael","family":"L\ufffdwe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"J. Adamek, H. Herrlich, and G. Strecker: 1990,Abstract and Concrete Categories, Wiley Interscience."},{"key":"CR2","unstructured":"M. Beyer, H. Ehrig, and M. L\ufffdwe (eds.): 1992,Computing by Graph Transformation (COMPUGRAPH) ? Survey, Results, and Application, Booklet for the presentation of ESPRIT BR WG No. 3299 at CeBIT fair, Hannover."},{"key":"CR3","first-page":"307","volume":"34","author":"P. Boehm","year":"1987","unstructured":"P. Boehm, H. Fonio, and A. Habel: 1987, ?Amalgamation of graph transformations: A synchronization mechanism?,JCSS 34, 307?408.","journal-title":"JCSS"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"P.M. van den Broek: 1991,Algebraic Graph Rewriting Using a Single Pushout, International Joint Conf. on Theory and Practice of Software Development 1991 (TAPSOFT'91), LNCS 493, pp. 90?102.","DOI":"10.1007\/3-540-53982-4_6"},{"key":"CR5","unstructured":"A. Corradini, H. Ehrig, M. L\ufffdwe, U. Montanari, and F. Rossi: 1992, ?Note on Standard Representation of Graphs and Graph Derivations?, Technical Report TU Berlin, FB 20, No. 92?25."},{"key":"CR6","unstructured":"J. Dingel: 1992, ?Canonical Derivation Sequences in the Single-Pushout Approach for Graph Derivations?, Techn. Report, TU Berlin, FB 20, No. 92?36."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"H. Ehrig: 1979, ?Introduction to the algebraic theory of graph grammars (A Survey)?, in:Graph Grammars and Their Application to Computer Science and Biology, Springer LNCS 73, 1?69.","DOI":"10.1007\/BFb0025714"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce: 1991,From Graph Grammars to High-Level Replacement Systems, Proc. 4th Int. Workshop on Graph Grammars and Application to Computer Science, Springer LNCS 532, pp. 269?291.","DOI":"10.1007\/BFb0017395"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129500001353","volume":"1","author":"H. Ehrig","year":"1991","unstructured":"H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce: 1991, ?Parallelism and concurrency in high-level-replacement systems?,Math. Struct. in Comp. Science 1, 361?404.","journal-title":"Math. Struct. in Comp. Science"},{"key":"CR10","unstructured":"H. Ehrig, H.-J. Kreowski, and G. Taentzer: 1992, ?Canonical Derivations for HLR-Systems, Techn. Report, FB Mathematik-Informatik, Univ. Bremen, to appear."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(93)90066-3","volume":"109","author":"H. Ehrig","year":"1993","unstructured":"H. Ehrig and M. L\ufffdwe: 1993, ?Parallel and Distributed Derivations in the Single-Pushout Approach?,Theoret. Comp. Sci. 109, 123?143.","journal-title":"Theoret. Comp. Sci."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"H. Ehrig and B. Mahr: 1985,Fundamentals of Algebraic Specification 1. Equations and Initial Semantics, EATCS Monographs on Theoretical Computer Science, Vol. 6, Springer.","DOI":"10.1007\/978-3-642-69962-7"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"H. Ehrig and B. Mahr: 1990,Fundamentals of Algebraic Specification 2. Module Specifications and Constraints, EATCS Monographs on Theoretical Computer Science, Vol. 21, Springer-Verlag.","DOI":"10.1007\/978-3-642-61284-8_4"},{"key":"CR14","unstructured":"H. Ehrig and F. Parisi-Presicce: 1991, ?Non-equivalence of categories for equational algebraic specifications in view of High-Level-Replacement systems?, Techn. Report, FB Informatik, TU Berlin, No. 9?16."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Pfender, and H.J. Schneider: 1973,Graph Grammars: An Algebraic Approach, Proc. IEEE Conf. SWAT'73, Iowa City, p. 167?180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"H. Ehrig and B.K. Rosen: ?Parallelism and concurrency of graph manipulations?,Theoretical Computer Science 11, 247?275.","DOI":"10.1016\/0304-3975(80)90016-X"},{"key":"CR17","unstructured":"A. Habel: 1989, ?Hyperedge Replacement: Grammars and Languages?, PhD Thesis, University of Bremen, to appear as Springer LNCS-volume."},{"key":"CR18","volume-title":"Category Theory","author":"H. Herrlich","year":"1973","unstructured":"H. Herrlich and G. Strecker: 1973,Category Theory, Allyn and Bacon, Rockleigh, New Jersey."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(90)90171-D","volume":"77","author":"Y. Kawahara","year":"1990","unstructured":"Y. Kawahara: 1990, ?Pushout-complements and basic concepts of grammars in toposs?,Theoretical Computer Science 77, 267?289.","journal-title":"Theoretical Computer Science"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","volume":"52","author":"J.R. Kennaway","year":"1987","unstructured":"J.R. Kennaway: 1987, ?On ?On Graph Rewriting??,Theoretical Computer Science 52, 37?58.","journal-title":"Theoretical Computer Science"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"J.R. Kennaway: 1991,Graph Rewriting in some Categories of Partial Maps, in 4th Int. Workshop on Graph Grammars, Springer LNCS 532, 490?504.","DOI":"10.1007\/BFb0017408"},{"key":"CR22","unstructured":"H.-J. Kreowski: 1922, ?Manipulation von Graphmanipulationen?, PhD Thesis, TU Berlin, FB 20."},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"H.-J. Kreowski: 1977,Transformations of Derivation Sequences in Graph Grammars, Springer LNCS 56, 275?286.","DOI":"10.1007\/3-540-08442-8_94"},{"key":"CR24","first-page":"181","volume":"109","author":"M. L\ufffdwe","year":"1990","unstructured":"M. L\ufffdwe: 1990, ?Extended Algebraic Graph Transformation?, PhD Thesis, TU Berlin, FB 20, short version inTheoretical Computer Science 109, 181?224.","journal-title":"TU Berlin, FB 20, short version in Theoretical Computer Science"},{"key":"CR25","unstructured":"M. L\ufffdwe: 1992, ?The Categorical Vademecum to Single-Pushout Rewriting?, Techn. Report, TU Berlin, FB 20."},{"key":"CR26","volume-title":"Categories for the Working Mathematician","author":"S. MacLane","year":"1972","unstructured":"S. MacLane: 1972,Categories for the Working Mathematician, Springer, New York, Heidelberg-Berlin."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"Meseguer and U. Montanari: 1990, ?Petri-nets are monoids: A new algebraic foundation for net theory?,Information and Computation 88 (2).","DOI":"10.1016\/0890-5401(90)90013-8"},{"key":"CR28","unstructured":"J. Padberg: 1992, ?Theory of High-Level-Replacement Systems and its Applications to Petri-Nets?, Diplome Thesis, TU Berlin, FB 20."},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"F. Parisi-Presicce, H. Ehrig, and U. Montanari: 1987,Graph Rewriting with Unification and Composition, Proc. 3rd Int. Workshop on Graph Grammars, Springer LNCS 291, 496?511.","DOI":"10.1007\/3-540-18771-5_72"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"F. Parisi-Presicce: 1989,Modular System Design Applying Graph Grammar Techniques, Proc. 16 ICALP, Springer LNCS 372, 621?636.","DOI":"10.1007\/BFb0035788"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"F. Parisi-Presicce: 1990,A Rule-Based Approach to Modular System Design, Proc. 12th Int. Conf. Soft. Eng., Nice (France), 202?211.","DOI":"10.1109\/ICSE.1990.63624"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","volume":"32","author":"J.C. Raoult","year":"1984","unstructured":"J.C. Raoult: 1984, ?On graph rewriting?,Theoretical Computer Science 32, 1?24.","journal-title":"Theoretical Computer Science"},{"key":"CR33","unstructured":"G. Taentzer: 1992, ?Parallel High-Level Replacement Systems?, Technical Report No. 92?10, TU Berlin, FB 20."}],"container-title":["Applied Categorical Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00872984.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00872984\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00872984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T03:17:56Z","timestamp":1682911076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00872984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00872984"],"URL":"https:\/\/doi.org\/10.1007\/bf00872984","relation":{},"ISSN":["0927-2852","1572-9095"],"issn-type":[{"value":"0927-2852","type":"print"},{"value":"1572-9095","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}