{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:11:51Z","timestamp":1725574311299},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249368"},{"type":"electronic","value":"9783540318477"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31847-7_5","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T19:51:47Z","timestamp":1294429907000},"page":"84-100","source":"Crossref","is-referenced-by-count":3,"title":["Graph Processes with Fusions: Concurrency by Colimits, Again"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1142\/9789812814951_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"P. Baldan","year":"1999","unstructured":"Baldan, P., Corradini, A., Ehrig, H., L\u00f6we, M., Montanari, U., Rossi, F.: Concurrent semantics of algebraic graph transformation. In: Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a03, pp. 107\u2013187. World Scientific, Singapore (1999)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. Theor. Comp. Sci.\u00a096, 217\u2013248 (1992)","journal-title":"Theor. Comp. Sci."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(01)00318-8","volume":"286","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connections. Theor. Comp. Sci.\u00a0286, 247\u2013292 (2002)","journal-title":"Theor. Comp. Sci."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. Theor. Comp. Sci.\u00a0240, 177\u2013213 (2000)","journal-title":"Theor. Comp. Sci."},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1051\/ita:1999128","volume":"33","author":"A. Corradini","year":"1999","unstructured":"Corradini, A., Gadducci, F.: Rewriting on cyclic structures: Equivalence between the operational and the categorical description. Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications\u00a033, 467\u2013493 (1999)","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae\u00a026, 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90171-B","volume":"99","author":"V.-E. C\u0103z\u0103nescu","year":"1992","unstructured":"C\u0103z\u0103nescu, V.-E., \u015etef\u0103nescu, G.: A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. Theor. Comp. Sci.\u00a099, 1\u201363 (1992)","journal-title":"Theor. Comp. Sci."},{"key":"5_CR9","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Habel, A., Kreowski, H.-J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0304-3975(99)00037-7","volume":"221","author":"Y. Fu","year":"1999","unstructured":"Fu, Y.: Variations on mobile processes. Theor. Comp. Sci.\u00a0221, 327\u2013368 (1999)","journal-title":"Theor. Comp. Sci."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-40018-9_4","volume-title":"Programming Languages and Systems","author":"F. Gadducci","year":"2003","unstructured":"Gadducci, F.: Term graph rewriting and the \u03c0-calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 37\u201354. Springer, Heidelberg (2003)"},{"key":"5_CR12","series-title":"Electr. Notes in Theor . Comp. Sci.","volume-title":"Category Theory and Computer Science","author":"F. Gadducci","year":"1999","unstructured":"Gadducci, F., Heckel, R., Llabr\u00e9s, M.: A bi-categorical axiomatisation of concurrent graph rewriting. In: Hofmann, M., Pavlovic\u0300, D., Rosolini, G. (eds.) Category Theory and Computer Science. Electr. Notes in Theor. Comp. Sci., vol.\u00a029. Elsevier Science, Amsterdam (1999)"},{"key":"5_CR13","volume-title":"Mathematical Foundations of Programming Semantics","author":"F. Gadducci","year":"2001","unstructured":"Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Brookes, S., Mislove, M. (eds.) Mathematical Foundations of Programming Semantics. Electr. Notes in Theor. Comp. Sci., vol.\u00a045. Elsevier Science, Amsterdam (2001)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44612-5_33","volume-title":"Mathematical Foundations of Computer Science 2000","author":"P. Gardner","year":"2000","unstructured":"Gardner, P., Wischik, L.: Explicit fusion. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 373\u2013382. Springer, Heidelberg (2000)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U. Golz","year":"1983","unstructured":"Golz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Information and Control\u00a057, 125\u2013147 (1983)","journal-title":"Information and Control"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1017\/S0960129501003425","volume":"11","author":"A. Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science\u00a011, 637\u2013688 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-45500-0_6","volume-title":"Theoretical Aspects of Computer Software","author":"C. Laneve","year":"2001","unstructured":"Laneve, C., Parrow, J., Victor, B.: Solo diagrams. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 127\u2013144. Springer, Heidelberg (2001)"},{"key":"5_CR18","first-page":"675","volume":"13","author":"C. Laneve","year":"2002","unstructured":"Laneve, C., Victor, B.: Solos in concert. Mathematical Structures in Computer Science\u00a013, 675\u2013683 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR19","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Part I and II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Part I and II. Information and Computation"},{"key":"5_CR21","first-page":"176","volume-title":"Logic in Computer Science","author":"J. Parrow","year":"1998","unstructured":"Parrow, J., Victor, B.: The fusion calculus: Expressiveness and simmetry in mobile processes. In: Pratt, V. (ed.) Logic in Computer Science, pp. 176\u2013185. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"5_CR22","unstructured":"Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Software and Systems Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31847-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:32Z","timestamp":1605760112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31847-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249368","9783540318477"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31847-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}