{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:49:01Z","timestamp":1725515341268},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540686767"},{"type":"electronic","value":"9783540686798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68679-8_34","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T02:58:16Z","timestamp":1213066696000},"page":"544-562","source":"Crossref","is-referenced-by-count":3,"title":["A Category of Explicit Fusions"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Grazia","family":"Buscemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Ciancia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","first-page":"69","volume-title":"Proc. of LICS","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS, pp. 69\u201380. IEEE, Los Alamitos (2006)"},{"key":"34_CR2","series-title":"Lecture Notes in Artificial Intelligence","first-page":"364","volume-title":"Machine Learning: ECML 2007","author":"F. Bonchi","year":"2007","unstructured":"Bonchi, F., Montanari, U.: Coalgebraic models for reactive systems. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol.\u00a04701, pp. 364\u2013380. Springer, Heidelberg (2007)"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/978-3-540-78499-9_28","volume-title":"FOSSACS 2008","author":"F. Bonchi","year":"2008","unstructured":"Bonchi, F., Montanari, U.: Symbolic semantics revisited. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 395\u2013412. Springer, Heidelberg (2008)"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/978-3-540-30477-7_20","volume-title":"Programming Languages and Systems","author":"M. Boreale","year":"2004","unstructured":"Boreale, M., Buscemi, M.G., Montanari, U.: D-fusion: A distinctive fusion calculus. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol.\u00a03302, pp. 296\u2013310. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(97)00125-4","volume":"198","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., Sangiorgi, D.: Some congruence properties for pi-calculus bisimilarities. Theoret. Comput. Sci.\u00a0198(1-2), 159\u2013176 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45694-5_30","volume-title":"CONCUR 2002 - Concurrency Theory","author":"M.G. Buscemi","year":"2002","unstructured":"Buscemi, M.G., Montanari, U.: A first order coalgebraic model of pi-calculus early observational equivalence. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 449\u2013465. Springer, Heidelberg (2002)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-71316-6_3","volume-title":"Programming Languages and Systems","author":"M.G. Buscemi","year":"2007","unstructured":"Buscemi, M.G., Montanari, U.: Cc-pi: A constraint-based language for specifying service level agreements. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 18\u201332. Springer, Heidelberg (2007)"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.jlap.2007.05.001","volume":"72","author":"M.G. Buscemi","year":"2007","unstructured":"Buscemi, M.G., Montanari, U.: A compositional coalgebraic model of fusion calculus. J. Log. Algebr. Program.\u00a072(1), 78\u201397 (2007)","journal-title":"J. Log. Algebr. Program."},{"key":"34_CR9","unstructured":"Ciancia, V., Montanari, U.: A name abstraction functor for named sets. In: Proc. of CMCS. Elect. Notes in Th. Comput. Sci (to appear, 2008)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45931-6_10","volume-title":"Foundations of Software Science and Computation Structures","author":"G.L. Ferrari","year":"2002","unstructured":"Ferrari, G.L., Montanari, U., Pistore, M.: Minimizing transition systems for name passing calculi: A co-algebraic formulation. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 129\u2013158. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"34_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.09.021","volume":"331","author":"G.L. Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E.: Coalgebraic minimization of HD-automata for the pi-calculus using polymorphic types. Theoret. Comput. Sci.\u00a0331(2-3), 325\u2013365 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/11548133_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G.L. Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E., Victor, B., Yemane, K.: Modelling fusion calculus using HD-automata. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 142\u2013156. Springer, Heidelberg (2005)"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1006\/inco.2002.2968","volume":"179","author":"M.P. Fiore","year":"2002","unstructured":"Fiore, M.P., Moggi, E., Sangiorgi, D.: A fully abstract model for the \u03c0-calculus. Inf. Comput.\u00a0179(1), 76\u2013117 (2002)","journal-title":"Inf. Comput."},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Fiore, M.P., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. In: Proc. of LICS, pp. 193\u2013202 (1999)","DOI":"10.1109\/LICS.1999.782615"},{"key":"34_CR15","first-page":"93","volume-title":"Proc. of LICS","author":"M.P. Fiore","year":"2001","unstructured":"Fiore, M.P., Turi, D.: Semantics of name and value passing. In: Proc. of LICS, pp. 93\u2013104. IEEE, Los Alamitos (2001)"},{"issue":"3-5","key":"34_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput.\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Asp. Comput."},{"issue":"2-3","key":"34_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10990-006-8749-3","volume":"19","author":"F. Gadducci","year":"2006","unstructured":"Gadducci, F., Miculan, M., Montanari, U.: About permutation algebras (pre)sheaves and named sets. Higher-Order and Symbolic Computation\u00a019(2-3), 283\u2013304 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"34_CR19","series-title":"Lecture Notes in Computer Science","first-page":"105","volume-title":"The Programming Language Ada","author":"N. Ghani","year":"1981","unstructured":"Ghani, N., Yemane, K., Victor, B.: Relationally staged computations in calculi of mobile processes. In: The Programming Language Ada. LNCS, vol.\u00a0106, pp. 105\u2013120. Springer, Heidelberg (1981)"},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/3-540-07854-1_231","volume-title":"Mathematical Foundations of Computer Science 1976","author":"V. Giarratana","year":"1976","unstructured":"Giarratana, V., Gimona, F., Montanari, U.: Observability concepts in abstract data type specifications. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol.\u00a045, pp. 576\u2013587. Springer, Heidelberg (1976)"},{"key":"34_CR21","first-page":"204","volume-title":"Proc. of LICS","author":"M. Hofmann","year":"1999","unstructured":"Hofmann, M.: Semantical analysis of higher-order abstract syntax. In: Proc. of LICS, pp. 204\u2013213. IEEE, Los Alamitos (1999)"},{"issue":"1-2","key":"34_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/S147106840600281X","volume":"7","author":"I. Lanese","year":"2007","unstructured":"Lanese, I., Montanari, U.: Mapping fusion and synchronized hyperedge replacement into logic programming. Theory Pract. Log. Program.\u00a07(1-2), 123\u2013151 (2007)","journal-title":"Theory Pract. Log. Program."},{"key":"34_CR23","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.J. Leifer","year":"2000","unstructured":"Leifer, J.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":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-540-31982-5_11","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Miculan","year":"2005","unstructured":"Miculan, M., Yemane, K.: A unifying model of variables and names. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 170\u2013186. Springer, Heidelberg (2005)"},{"key":"34_CR25","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"1","key":"34_CR26","doi-asserted-by":"publisher","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, I and II. Inform. and Comput.\u00a0100(1), 1\u201340 (1992)","journal-title":"Inform. and Comput."},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: An introduction to history dependent automata. In: Proc. of HOOTS. Elect. Notes in Th. Comput. Sci, vol.\u00a010, pp. 170\u2013188 (1997)","DOI":"10.1016\/S1571-0661(05)80696-6"},{"issue":"3","key":"34_CR28","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.tcs.2005.03.014","volume":"340","author":"U. Montanari","year":"2005","unstructured":"Montanari, U., Pistore, M.: Structured coalgebras and minimal HD-automata for the pi-calculus. Theoret. Comput. Sci.\u00a0340(3), 539\u2013576 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"34_CR29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1992-16206","volume":"16","author":"U. Montanari","year":"1992","unstructured":"Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae\u00a016(1), 171\u2013199 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"34_CR30","first-page":"176","volume-title":"Proc. of LICS","author":"J. Parrow","year":"1998","unstructured":"Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc. of LICS, pp. 176\u2013185. IEEE, Los Alamitos (1998)"},{"key":"34_CR31","unstructured":"Pistore, M.: History Dependent Automata. PhD thesis, Universit\u00e0 di Pisa, Dipartimento di Informatica, Available at University of Pisa as PhD. Thesis TD-5\/99 (1999)"},{"key":"34_CR32","unstructured":"Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department (1981)"},{"issue":"1","key":"34_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"34_CR34","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the \u03c0-calculus. Acta Inform.\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Inform."},{"key":"34_CR35","unstructured":"Scott, D., Strachey, C.: Toward a mathematical semantics for computer languages. In: Programming Research Group Technical Monograph, Oxford University, Computing Laboratory, vol.\u00a0PRG-6 (1971)"},{"key":"34_CR36","first-page":"36","volume-title":"Proc. of LICS","author":"I. Stark","year":"1996","unstructured":"Stark, I.: A fully abstract domain model for the \u03c0-calculus. In: Proc. of LICS, pp. 36\u201342. IEEE, Los Alamitos (1996)"},{"key":"34_CR37","first-page":"280","volume-title":"Proc. of LICS","author":"D. Turi","year":"1997","unstructured":"Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Proc. of LICS, pp. 280\u2013291. IEEE, Los Alamitos (1997)"},{"key":"34_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/978-3-540-24727-2_34","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Wischik","year":"2004","unstructured":"Wischik, L., Gardner, P.: Strong bisimulation for the explicit fusion calculus. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 484\u2013498. Springer, Heidelberg (2004)"},{"issue":"3","key":"34_CR39","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.tcs.2005.03.017","volume":"340","author":"L. Wischik","year":"2005","unstructured":"Wischik, L., Gardner, P.: Explicit fusions. Theoret. Comput. Sci.\u00a0340(3), 606\u2013630 (2005)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Concurrency, Graphs and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68679-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:45:38Z","timestamp":1631393138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}