{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:43Z","timestamp":1725551683266},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309116"},{"type":"electronic","value":"9783540324256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_9","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T05:39:45Z","timestamp":1134193185000},"page":"106-126","source":"Crossref","is-referenced-by-count":9,"title":["Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes"],"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":"9_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":"9_CR2","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":"9_CR3","unstructured":"Barr, M., Wells, C.: Category Theory for Computing Science. Les Publications CMR (1999)"},{"key":"9_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":"9_CR5","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":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-30203-2_12","volume-title":"Graph Transformations","author":"H. Ehrig","year":"2004","unstructured":"Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 144\u2013160. Springer, Heidelberg (2004)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(97)00179-5","volume":"211","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Gelsema, T.: Multisets and structural congruence of the \u03c0-calculus with replication. Theor. Comp. Sci.\u00a0211, 311\u2013337 (1999)","journal-title":"Theor. Comp. Sci."},{"key":"9_CR8","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":"9_CR9","series-title":"Lecture Notes in Computer Science","first-page":"219","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F. Gadducci","year":"1998","unstructured":"Gadducci, F., Heckel, R.: An inductive view of graph transformation. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 219\u2013233. Springer, Heidelberg (1998)"},{"key":"9_CR10","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":"9_CR11","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":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-31847-7_5","volume-title":"Formal Methods in Software and Systems Modeling","author":"F. Gadducci","year":"2005","unstructured":"Gadducci, F., Montanari, U.: Graph processes with fusions: concurrency by colimits, again. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol.\u00a03393, pp. 84\u2013100. Springer, Heidelberg (2005)"},{"key":"9_CR13","unstructured":"Hasegawa, M.: Models of Sharing Graphs. PhD thesis, University of Edinburgh, Department of Computer Science (1997)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.: Premonoidal categories and a graphical view of programs. Technical report, School of Cognitive and Computing Sciences, University of Sussex (1997)","DOI":"10.1016\/S1571-0661(05)80688-7"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S. Lack","year":"2005","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications\u00a039, 511\u2013545 (2005)","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J. Leifer","year":"2000","unstructured":"Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"9_CR17","first-page":"159","volume-title":"Combinatory Logic, Lambda Calculus and Formalism: Essays in honour of Haskell B. Curry","author":"J.-J. L\u00e9vy","year":"1980","unstructured":"L\u00e9vy, J.-J.: Optimal reductions in the lambda-calculus. In: Seldin, J.P., Hindley, J.R. (eds.) Combinatory Logic, Lambda Calculus and Formalism: Essays in honour of Haskell B. Curry, pp. 159\u2013191. Academic Press, London (1980)"},{"key":"9_CR18","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":"9_CR19","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":"9_CR20","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":"9_CR21","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":"9_CR22","first-page":"163","volume":"10","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Soboci\u0144ski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing\u00a010, 163\u2013183 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"9_CR23","first-page":"311","volume-title":"Logic in Computer Science","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Logic in Computer Science, pp. 311\u2013320. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(00)00309-1","volume":"274","author":"P. Sewell","year":"2004","unstructured":"Sewell, P.: From rewrite rules to bisimulation congruences. Theor. Comp. Sci.\u00a0274, 183\u2013230 (2004)","journal-title":"Theor. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T16:57:54Z","timestamp":1706806674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11601548_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}