{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:24Z","timestamp":1761611184823},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_91","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"240-256","source":"Crossref","is-referenced-by-count":6,"title":["An event structure semantics for graph grammars with parallel productions"],"prefix":"10.1007","author":[{"given":"A.","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Ehrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"L\u00f6we","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"17_CR1","unstructured":"M.A. Bednarczyk, Categories of asynchronous systems, Ph.D. Thesis, University of Sussex, Report no. 1\/88, 1988."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"A. Corradini, H. Ehrig, M. L\u00f6we, U. Montanari and F. Rossi, Note on Standard Representation of Graphs and Graph Derivations, in [17], 104\u2013118. (Also as Technical Report \u201cBericht-Nr. 92-25\u201d, Technische Universit\u00e4t Berlin, Fachbereich 20 Informatik, 1992.)","DOI":"10.1007\/3-540-57787-4_7"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"A. Corradini, H. Ehrig, M. L\u00f6we, U. Montanari and F. Rossi, Abstract Graph Derivations in the Double Pushout Approach, in [17], 86\u2013103.","DOI":"10.1007\/3-540-57787-4_6"},{"key":"17_CR4","unstructured":"A. Corradini, H. Ehrig, M. L\u00f6we, U. Montanari and F. Rossi, An Event Structure Semantics for Safe Graph Grammars, in Programming Concepts, Methods and Calculi, E.-R. Olderog (ed.), IFIP Transactions A-56, North-Holland, 1994, 423\u2013444."},{"key":"17_CR5","unstructured":"A. Corradini, H. Ehrig, M. L\u00f6we, U. Montanari and F. Rossi, Algebraic Approach to Graph Transformation II: Models of Computation in the Double Pushout Approach, submitted, 1995."},{"key":"17_CR6","unstructured":"A. Corradini, U. Montanari and F. Rossi, Graph Processes, to appear in Fundamenta Informaticae, 1995."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"A. Corradini, Concurrent computing: From Petri nets to graph grammars, in Proceedings SEGRAGRA '95, Electronic Notes in Theoretical Computer Science, Volume 2, URL: http:\/\/www.elsevier.nl\/locate\/entcs\/volume2.html.","DOI":"10.1016\/S1571-0661(05)80181-1"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"H. Ehrig, Tutorial introduction to the algebraic approach of graph-grammars, LNCS 291, Springer-Verlag, 1987, 3\u201314.","DOI":"10.1007\/3-540-18771-5_40"},{"key":"17_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, F. Parisi-Presicce, Parallelism and Concurrency in High-Level Replacement Systems, in Mathematical Structures in Computer Science, 1, 1991, 361\u2013404.","journal-title":"Mathematical Structures in Computer Science"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Pfender, H.J. Schneider, Graph-grammars: an algebraic approach, Proc, IEEE Conf. on Automata and Switching Theory, 1973, 167\u2013180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"17_CR11","volume-title":"Ph.D. Thesis","author":"H.-J. Kreowski","year":"1977","unstructured":"H.-J. Kreowski, Manipulationen von Graphmanipulationen, Ph.D. Thesis, Technische Universit\u00e4t Berlin, 1977."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"H.-J. Kreowski, Is parallelism already concurrency? Part 1: Derivations in graph grammars, LNCS 291, Springer-Verlag, 1987, 343\u2013360.","DOI":"10.1007\/3-540-18771-5_63"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"S. Mac Lane, Categories for the working mathematician, Springer Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"J. Meseguer, U. Montanari, and V. Sassone, On the semantics of Petri Nets, in Proceedings CONCUR '92, LNCS 630, 286\u2013301.","DOI":"10.1007\/BFb0084798"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-69968-9"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"G. Schied, On relating Rewriting Systems and Graph Grammars to Event Structures, in [17], 326\u2013340.","DOI":"10.1007\/3-540-57787-4_21"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"H.J. Schneider and H. Ehrig (Eds.), Proceedings of the Dagstuhl Seminar 9301 on Graph Transformations in Computer Science, LNCS 776, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57787-4"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"V. Sassone, M. Nielsen and G. Winskel, A classification of models for concurrency, in Proceedings CONCUR '93, LNCS 715, Springer-Verlag, 1993, 82\u201396.","DOI":"10.1007\/3-540-57208-2_7"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"G. Winskel, An Introduction to Event Structures, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer-Verlag, 1989, 364\u2013397.","DOI":"10.1007\/BFb0013026"}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:02:14Z","timestamp":1555711334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}