{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:25:05Z","timestamp":1725564305900},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205364"},{"type":"electronic","value":"9783540400189"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40018-9_4","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:03:20Z","timestamp":1283713400000},"page":"37-54","source":"Crossref","is-referenced-by-count":15,"title":["Term Graph Rewriting for the \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-45711-9_11","volume-title":"Formal and Natural Computing","author":"A. Baldan","year":"2002","unstructured":"Baldan, A., Corradini, P., Montanari, U.: Bisimulation equivalences for graph grammars. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 158\u2013190. Springer, Heidelberg (2002)"},{"key":"4_CR2","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":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"H.P. Barendregt","year":"1987","unstructured":"Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R.: Term graph reduction. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 141\u2013158. Springer, Heidelberg (1987)"},{"key":"4_CR4","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":"4_CR5","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":"4_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1008647417502","volume":"7","author":"A. Corradini","year":"1999","unstructured":"Corradini, A., Gadducci, F.: An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures\u00a07, 299\u2013331 (1999)","journal-title":"Applied Categorical Structures"},{"key":"4_CR7","doi-asserted-by":"publisher","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":"4_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(94)90206-2","volume":"122","author":"A. Corradini","year":"1994","unstructured":"Corradini, A., Montanari, U., Rossi, F.: An abstract machine for concurrent modular systems: CHARM. Theor. Comp. Sci.\u00a0122, 165\u2013200 (1994)","journal-title":"Theor. Comp. Sci."},{"key":"4_CR9","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, World Scientific, Singapore (1997)"},{"key":"4_CR10","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":"4_CR11","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":"4_CR12","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":"4_CR13","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":"4_CR14","series-title":"Electr. Notes in Theor. Comp. Sci.","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":"4_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(01)00362-0","volume":"285","author":"F. Gadducci","year":"2002","unstructured":"Gadducci, F., Montanari, U.: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theor. Comp. Sci.\u00a0285, 319\u2013358 (2002)","journal-title":"Theor. Comp. Sci."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-44618-4_7","volume-title":"CONCUR 2000 - Concurrency Theory","author":"P. Gardner","year":"2000","unstructured":"Gardner, P.: From process calculi to process frameworks. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 69\u201388. Springer, Heidelberg (2000)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J. Goguen","year":"1992","unstructured":"Goguen, J., Meseguer, J.: Order sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theor. Comp. Sci.\u00a0105, 217\u2013273 (1992)","journal-title":"Theor. Comp. Sci."},{"key":"4_CR18","unstructured":"Hasegawa, M.: Models of Sharing Graphs. PhD thesis, Department of Computer Science, University of Edinburgh (1997)"},{"key":"4_CR19","unstructured":"Jeffrey, A.: Premonoidal categories and a graphical view of programs. Technical report, School of Cognitive and Computing Sciences, University of Sussex (1997), Available at \n                    \n                      http:\/\/www.cogs.susx.ac.uk\/users\/alanje\/premon\/"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-48320-9_25","volume-title":"CONCUR\u201999. Concurrency Theory","author":"B. K\u00f6nig","year":"1999","unstructured":"K\u00f6nig, B.: Generating type systems for process graphs. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 352\u2013367. Springer, Heidelberg (1999)"},{"key":"4_CR21","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":"4_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comp. Sci.\u00a096, 73\u2013155 (1992)","journal-title":"Theor. Comp. Sci."},{"key":"4_CR23","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"4_CR24","series-title":"Nato ASI Series F","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-642-58041-3_6","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. Nato ASI Series F, vol.\u00a094, pp. 203\u2013246. Springer, Heidelberg (1993)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-57880-3_2","volume-title":"Programming Languages and Systems - ESOP \u201994","author":"R. Milner","year":"1994","unstructured":"Milner, R.: Pi-nets: A graphical formalism. In: Sannella, D. (ed.) ESOP 1994. LNCS, vol.\u00a0788, pp. 26\u201342. Springer, Heidelberg (1994)"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/BF03036472","volume":"33","author":"R. Milner","year":"1996","unstructured":"Milner, R.: Calculi for interaction. Acta Informatica\u00a033, 707\u2013737 (1996)","journal-title":"Acta Informatica"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 - Concurrency Theory","author":"R. Milner","year":"2001","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 16\u201335. Springer, Heidelberg (2001)"},{"key":"4_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1142\/9789812814951_0004","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"U. Montanari","year":"1999","unstructured":"Montanari, U., Pistore, M., Rossi, F.: Modeling concurrent, mobile and coordinated systems via graph transformations: Concurrency, parallellism, and distribution. In: Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a03, pp. 189\u2013268. World Scientific, Singapore (1999)"},{"key":"4_CR29","first-page":"407","volume":"2","author":"J. Parrow","year":"1995","unstructured":"Parrow, J.: Interaction diagrams. Nordic Journal of Computing\u00a02, 407\u2013443 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"4_CR30","unstructured":"Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)"},{"key":"4_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/9789812815149_0001","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"D. Plump","year":"1999","unstructured":"Plump, D.: Term graph rewriting. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, pp. 3\u201361. World Scientific, Singapore (1999)"},{"key":"4_CR32","volume-title":"The \u03c0-calculus: A Theory of Mobile Processes","author":"S. Sangiorgi","year":"2001","unstructured":"Sangiorgi, S., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BFb0026581","volume-title":"Theory and Practice of Parallel Programming","author":"N. Yoshida","year":"1995","unstructured":"Yoshida, N.: Graph notation for concurrent combinators. In: Ito, T., Yonezawa, A. (eds.) TPPP 1994. LNCS, vol.\u00a0907, pp. 393\u2013412. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40018-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T22:26:11Z","timestamp":1553034371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40018-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205364","9783540400189"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40018-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}