{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:46:00Z","timestamp":1764557160231},"reference-count":36,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2007,6]]},"abstract":"<jats:p>We propose a graphical implementation for (possibly recursive) processes of the \u03c0-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewriting mechanisms for modelling the reduction semantics of the calculus.<\/jats:p>","DOI":"10.1017\/s096012950700610x","type":"journal-article","created":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T13:51:23Z","timestamp":1183729883000},"page":"407-437","source":"Crossref","is-referenced-by-count":25,"title":["Graph rewriting for the \u03c0-calculus"],"prefix":"10.1017","volume":"17","author":[{"given":"FABIO","family":"GADDUCCI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2007,6,1]]},"reference":[{"key":"S096012950700610X_ref36","doi-asserted-by":"crossref","unstructured":"Yoshida N. (1994) Graph notation for concurrent combinators. In: Ito T. and Yonezawa A. (eds.) Theory and Practice of Parallel Programming. Springer-Verlag Lecture Notes in Computer Science 907 393\u2013412.","DOI":"10.1007\/BFb0026581"},{"key":"S096012950700610X_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90171-B"},{"key":"S096012950700610X_ref2","doi-asserted-by":"crossref","unstructured":"Baldan P. , Gadducci F. and Montanari U. (2006) Concurrent rewriting for graphs with equivalences. In: Baier C. and Hermanns H. (eds.) Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 4137 279\u2013294.","DOI":"10.1007\/11817949_19"},{"key":"S096012950700610X_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44685-0_2"},{"key":"S096012950700610X_ref22","unstructured":"Gadducci F. and Montanari U. (2001) A concurrent graph semantics for mobile ambients. In: Brookes S. and Mislove M. (eds.) Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science 45."},{"key":"S096012950700610X_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90185-I"},{"key":"S096012950700610X_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008647417502"},{"key":"S096012950700610X_ref16","doi-asserted-by":"crossref","unstructured":"Ehrig H. and K\u00f6nig B. (2004) Deriving bisimulation congruences in the DPO approach to graph rewriting. In: Walukiewicz I. (ed.) Foundations of Software Science and Computation Structures. Springer-Verlag Lecture Notes in Computer Science 2987 151\u2013166.","DOI":"10.1007\/978-3-540-24727-2_12"},{"key":"S096012950700610X_ref18","doi-asserted-by":"crossref","unstructured":"Gadducci F. (2003) Term graph rewriting and the \u03c0-calculus. In: Ohori A. (ed.) Programming Languages and Semantics. Springer-Verlag Lecture Notes in Computer Science 2895 37\u201354.","DOI":"10.1007\/978-3-540-40018-9_4"},{"key":"S096012950700610X_ref28","doi-asserted-by":"crossref","unstructured":"Leifer J. and Milner R. (2000) Deriving bisimulation congruences for reactive systems. In: Palamidessi C. (ed.) Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 1877 243\u2013258.","DOI":"10.1007\/3-540-44618-4_19"},{"key":"S096012950700610X_ref1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812814951_0003"},{"key":"S096012950700610X_ref4","doi-asserted-by":"crossref","unstructured":"Bonchi F. , Gadducci F. and K\u00f6nig B. (2006) Process bisimulation via a graphical encoding. In: Corradini A. , Ehrig H. , Montanari U. , Ribeiro L. and Rozenberg G. (eds.) Graph Transformation. Springer-Verlag Lecture Notes in Computer Science 4187 168\u2013183.","DOI":"10.1007\/11841883_13"},{"key":"S096012950700610X_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00318-8"},{"key":"S096012950700610X_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00137-8"},{"key":"S096012950700610X_ref10","doi-asserted-by":"publisher","DOI":"10.1051\/ita:1999128"},{"key":"S096012950700610X_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90206-2"},{"key":"S096012950700610X_ref14","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720_0005"},{"key":"S096012950700610X_ref12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","article-title":"Graph processes","volume":"26","author":"Corradini","year":"1996","journal-title":"Fundamenta Informaticae"},{"key":"S096012950700610X_ref13","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720_0003"},{"key":"S096012950700610X_ref21","doi-asserted-by":"crossref","unstructured":"Gadducci F. and Lluch Lafuente A. (2007) Graphical encoding of a spatial logic for the \u03c0-calculus. In: Montanari U. and Mossakowski T. (eds.) Algebra and Coalgebra in Computer Science. Springer-Verlag Lecture Notes in Computer Science (to appear).","DOI":"10.1007\/978-3-540-73859-6_15"},{"key":"S096012950700610X_ref15","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720_0002"},{"key":"S096012950700610X_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00037-7"},{"key":"S096012950700610X_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00362-0"},{"key":"S096012950700610X_ref20","doi-asserted-by":"crossref","unstructured":"Gadducci F. and Lluch Lafuente A. (2006) Graphical verification of a spatial logic for the \u03c0-calculus. In: Heckel R. , K\u00f6nig B. and Rensink A. (eds.) Graph Transformation for Verification and Concurrency. Electronic Notes in Theoretical Computer Science 154.","DOI":"10.1016\/j.entcs.2005.03.031"},{"key":"S096012950700610X_ref6","doi-asserted-by":"crossref","unstructured":"Caires L. (2004) Behavioral and spatial observations in a logic for the \u03c0-calculus. In: Walukiewicz I. (ed.) Foundations of Software Science and Computation Structures. Springer-Verlag Lecture Notes in Computer Science 2987 72\u201387.","DOI":"10.1007\/978-3-540-24727-2_7"},{"key":"S096012950700610X_ref24","doi-asserted-by":"crossref","unstructured":"Gadducci F. and Montanari U. (2005) Observing reductions in nominal calculi via a graphical encoding of processes. In: Middeldorp A. van Oostrom V. , van Raamsdonk F. and de Vrijer R. C. (eds.) Processes, terms and cycles (Klop Festschrift). Springer-Verlag Lecture Notes in Computer Science 3838 106\u2013126.","DOI":"10.1007\/11601548_9"},{"key":"S096012950700610X_ref35","volume-title":"The \u03c0-calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"},{"key":"S096012950700610X_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90302-V"},{"key":"S096012950700610X_ref26","unstructured":"K\u00f6nig B. (1999) Generating type systems for process graphs. In: Baeten J. C. M. and Mauw S. (eds.) Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 1664 352\u2013367."},{"key":"S096012950700610X_ref27","doi-asserted-by":"crossref","unstructured":"Laneve C. , Parrow J. and Victor B. (2001) Solo diagrams. In: Kobayashi N. and Pierce B. (eds.) Theoretical Aspects of Computer Science. Springer-Verlag Lecture Notes in Computer Science 2215 127\u2013144.","DOI":"10.1007\/3-540-45500-0_6"},{"key":"S096012950700610X_ref29","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"S096012950700610X_ref19","doi-asserted-by":"crossref","unstructured":"Gadducci F. , Heckel R. and Llabr\u00e9s M. (1999) A bi-categorical axiomatisation of concurrent graph rewriting. In: Hofmann M. , Pavlovi\u010d D. and Rosolini G. (eds.) Category Theory and Computer Science. Electronic Notes in Theoretical Computer Science 29.","DOI":"10.1016\/S1571-0661(05)80309-3"},{"key":"S096012950700610X_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"S096012950700610X_ref32","doi-asserted-by":"publisher","DOI":"10.1142\/9789812814951_0004"},{"key":"S096012950700610X_ref33","unstructured":"Plotkin G. (1981) A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University."},{"key":"S096012950700610X_ref34","doi-asserted-by":"crossref","unstructured":"Plump D. (2005) Confluence of graph transformation revisited. In: Middeldorp A. , van Oostrom V. , van Raamsdonk F. and de Vrijer R. C. (eds.) Processes, terms and cycles (Klop Festschrift). Springer-Verlag Lecture Notes in Computer Science 3838 280\u2013308.","DOI":"10.1007\/11601548_16"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096012950700610X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T22:04:36Z","timestamp":1683929076000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096012950700610X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["S096012950700610X"],"URL":"https:\/\/doi.org\/10.1017\/s096012950700610x","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}