{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:59Z","timestamp":1725663719920},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540538325"},{"type":"electronic","value":"9783540463108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53832-1_52","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:13:46Z","timestamp":1330208026000},"page":"338-353","source":"Crossref","is-referenced-by-count":11,"title":["Algebraic approach to graph transformation based on single pushout derivations"],"prefix":"10.1007","author":[{"given":"M.","family":"L\u00f6we","sequence":"first","affiliation":[]},{"given":"H.","family":"Ehrig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"26_CR1","first-page":"307","volume":"34","author":"P. Boehm","year":"1987","unstructured":"P. Boehm, H. Fonio, A. Habel: Amalgamation of Graph Transformation: A Synchronization Mechanisms, in: JCSS 34, 307\u2013408 (1987).","journal-title":"JCSS"},{"issue":"2","key":"26_CR2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/23005.24038","volume":"34","author":"P. Degano","year":"1987","unstructured":"P. Degano, U. Montanari: A Model of Distributed Systems Based on Graph Rewriting, in: Journal of the ACM 34 (2), 411\u2013449 (1987).","journal-title":"Journal of the ACM"},{"key":"26_CR3","first-page":"1","volume":"314","author":"H. Ehrig","year":"1988","unstructured":"H. Ehrig, P. Boehm, U. Hummert, M. L\u00f6we: Distributed Parallelism of Graph Transformations, in: Graph-Theoretical Concepts in Computer Science WG'87, Springer, LNCS 314, 1\u201319 (1988).","journal-title":"LNCS"},{"key":"26_CR4","unstructured":"H. Ehrig, A. Habel: Graph Grammars with Application Conditions, in: G. Rozenberg, A. Salomaa (eds.): The Book of L, Springer, 87\u2013100 (1985)."},{"key":"26_CR5","first-page":"1","volume":"73","author":"H. Ehrig","year":"1979","unstructured":"H. Ehrig: 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\u201369 (1979).","journal-title":"LNCS"},{"key":"26_CR6","unstructured":"H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce: High-level Replacement Systems, Techn. Report, submitted to the Fourth International Workshop on Graph Grammars and Their Application to Computer Science, Bremen, March 1990."},{"key":"26_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specifications 1","author":"H. Ehrig","year":"1985","unstructured":"H. Ehrig, B. Mahr: Fundamentals of Algebraic Specifications 1, Springer, Berlin (1985)."},{"key":"26_CR8","unstructured":"A. Habel: Hyperedge Replacement: Grammars and Languages, Dissertation, University Bremen (1989)."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-50667-5_71","volume-title":"Algebraic and Logic Programming","author":"B. Hoffmann","year":"1988","unstructured":"B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting, in: Algebraic and Logic Programming, Akademie Verlag, Berlin (DDR), 191\u2013203 (1988)."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","volume":"52","author":"R. Kennaway","year":"1987","unstructured":"R. Kennaway: On \u201cOn Graph Rewriting\u201d, in: Theoretical Computer Science 52, 37\u201358 (1987).","journal-title":"Theoretical Computer Science"},{"key":"26_CR11","first-page":"361","volume":"291","author":"H.-J. Kreowski","year":"1987","unstructured":"H.-J. Kreowski, A. Wilharm: Is Parallelism already concurrency? Part 2: Non-sequential Processes in Graph Grammars, in: Graph Grammars and Their Application to Computer Science, Springer, LNCS 291, 361\u2013377 (1987).","journal-title":"LNCS"},{"key":"26_CR12","unstructured":"M. L\u00f6we: Implementing Algebraic Specifications by Graph Transformation Systems, Techn. Report 89\/26, Technical University of Berlin (1989), to appear in EIK."},{"key":"26_CR13","unstructured":"M. L\u00f6we: Algebraic Approach to Graph Transformation Based on Single Pushout Derivations, Techn. Report No. 90\/5, Technical University of Berlin (1990)."},{"key":"26_CR14","first-page":"216","volume-title":"Sch\u00f6ne neue Computerwelt","author":"M. L\u00f6we","year":"1988","unstructured":"M. L\u00f6we, R. Wilhelm: Risiken polizeilicher Datenverarbeitung, in: Sch\u00f6ne neue Computerwelt, Verlag f\u00fcr Studium und Ausbildung in der Elefanten Press, Berlin, 216\u2013252 (1988)."},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(82)90056-1","volume":"19","author":"P. Padawitz","year":"1982","unstructured":"P. Padawitz: Graph Grammars and Operational Semantics, in: Theoretical Computer Science 19, 37\u201358 (1982).","journal-title":"Theoretical Computer Science"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"F. Parisi-Presicce: Modular System Design Applying Graph Grammars Techniques, in: ICALP'89, Springer, LNCS 372 (1989).","DOI":"10.1007\/BFb0035788"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"F. Parisi-Presicce, H. Ehrig, U. Montanari: Graph Rewriting with Unification and Composition, in: Graph Grammars and Their Application to Computer Science, Springer, LNCS 291 (1987).","DOI":"10.1007\/3-540-18771-5_72"},{"key":"26_CR18","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: On Graph Rewriting, in: Theoretical Computer Science 32, 1\u201324 (1984).","journal-title":"Theoretical Computer Science"},{"key":"26_CR19","first-page":"55","volume":"291","author":"G. Rozenberg","year":"1987","unstructured":"G. Rozenberg: An Introduction to the NLC way of rewriting graphs, in: Graph Grammars and Their Application to Computer Science, Springer, LNCS 291, 55\u201366 (1987).","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53832-1_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:16:17Z","timestamp":1619572577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53832-1_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540538325","9783540463108"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-53832-1_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}