{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:40Z","timestamp":1761611260059,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662464"},{"type":"electronic","value":"9783540484837"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48483-3_3","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:13:32Z","timestamp":1269897212000},"page":"31-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Normal Forms for Partitions and Relations"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"3_CR1","unstructured":"S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and the foundations of typed concurrent programming. In Deductive Program Design, Nato ASI Series, pages 403\u2013442. Springer Verlag, 1994."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z.M. Ariola","year":"1996","unstructured":"Z.M. Ariola and J.W. Klop. Equational term graph rewriting. Fundamenta Informaticae, 26:207\u2013240, 1996.","journal-title":"Fundamenta Informaticae"},{"key":"3_CR3","unstructured":"J.A. Bergstra and G. Stefanescu. Network algebra for synchronous and asynchronous dataflow. Technical Report Logic Group Preprint Series n. 122, Department of Philosophy, University of Utrecht, 1994."},{"key":"3_CR4","unstructured":"R. Bruni, J. Meseguer, and U. Montanari. Process and term tile logic. Technical Report SRI-CSL-98-06, SRI International, 1998."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0012-365X(91)90147-T","volume":"90","author":"V.A. Cazanescu","year":"1991","unstructured":"V.A. Cazanescu and G. Stefanescu. Classes of nite relations as initial abstract data types I. Discrete Mathematics, 90:233\u2013265, 1991.","journal-title":"Discrete Mathematics"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","volume":"13","author":"V.E. Cazanescu","year":"1990","unstructured":"V.E. Cazanescu and G. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13:171\u2013210, 1990.","journal-title":"Fundamenta Informaticae"},{"key":"3_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026983","volume-title":"Category Theory and Computer Science","author":"A. Corradini","year":"1997","unstructured":"A. Corradini and F. Gadducci. A 2-categorical presentation of term graph rewriting. In Category Theory and Computer Science, volume 1290 of LNCS. Springer Verlag, 1997."},{"key":"3_CR8","unstructured":"A. Corradini and F. Gadducci. An algebraic presentation of term graphs, via gsmonoidal categories. Applied Categorical Structures, 1998. To appear."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"A. Corradini and F. Gadducci. Functorial semantics for multi-algebras. Presented at WADT\u201998, 1998.","DOI":"10.1007\/3-540-48483-3_6"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s002360050064","volume":"33","author":"P. Degano","year":"1996","unstructured":"P. Degano, J. Meseguer, and U. Montanari. Axiomatizing the algebra of net computations and processes. Acta Informatica, 33:641\u2013647, 1996.","journal-title":"Acta Informatica"},{"key":"3_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0029949","volume-title":"Mathematical Foundations of Computer Science","author":"G. Ferrari","year":"1997","unstructured":"G. Ferrari and U. Montanari. A tile-based coordination view of the asynchronous \u03c0-calculus. In Mathematical Foundations of Computer Science, volume 1295 of LNCS, pages 52\u201370. Springer Verlag, 1997."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"G. Ferrari and U. Montanari. Tiles for concurrent and located calculi. In C. Palamidessi and J. Parrow, editors, Expressiveness in Concurrency, volume 7 of Electronic Notes in Computer Science. Elsevier Sciences, 1997.","DOI":"10.1016\/S1571-0661(05)80470-0"},{"key":"3_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-64299-4_36","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F. Gadducci","year":"1998","unstructured":"F. Gadducci and R. Heckel. An inductive view of graph transformation. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, volume 1376 of LNCS, pages 219\u2013233. Springer Verlag, 1998."},{"key":"3_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/BFb0055062","volume-title":"Automata, Languages and Programming","author":"F. Gadducci","year":"1998","unstructured":"F. Gadducci and U. Montanari. Axioms for contextual net processes. In Automata, Languages and Programming, volume 1443 of LNCS, pages 296\u2013308. Springer Verlag, 1998."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"F. Gadducci and U. Montanari. The tile model. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1999. to appear.","DOI":"10.7551\/mitpress\/5641.003.0010"},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-62688-3_37","volume-title":"Typed Lambda Calculi and Applications","author":"M. Hasegawa","year":"1997","unstructured":"M. Hasegawa. Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda-calculus. In Typed Lambda Calculi and Applications, volume 1210 of LNCS, pages 196\u2013213. Springer Verlag, 1997."},{"key":"3_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-08442-8_93","volume-title":"Fundamentals of Computations Theory","author":"H.-J. Hoenke","year":"1977","unstructured":"H.-J. Hoenke. On partial recursive de nitions and programs. In M. Karpinski, editor, Fundamentals of Computations Theory, volume 56 of LNCS, pages 260\u2013274. Springer Verlag, 1977."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0022-4049(96)00012-6","volume":"115","author":"P. Katis","year":"1997","unstructured":"P. Katis, N. Sabadini, and R.F.C. Walters. Bicategories of processes. Journal of Pure and Applied Algebra, 115:141\u2013178, 1997.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"3_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0000479","volume-title":"Algebraic Methodology and Software Technology","author":"P. Katis","year":"1997","unstructured":"P. Katis, N. Sabadini, and R.F.C. Walters. SPAN(Graph): A categorical algebra of transition systems. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of LNCS, pages 307\u2013321. Springer Verlag, 1997."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F.W. Lawvere","year":"1963","unstructured":"F.W. Lawvere. Functorial semantics of algebraic theories. Proc. National Academy of Science, 50:869\u2013872, 1963.","journal-title":"Proc. National Academy of Science"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"S. Mac Lane. Categories for the working mathematician. Springer Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"3_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, volume 1376 of LNCS. Springer Verlag, 1998."},{"key":"3_CR23","series-title":"Lect Notes Comput Sci","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"J. Meseguer and U. Montanari. Mapping tile logic into rewriting logic. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, volume 1376 of LNCS. Springer Verlag, 1998."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s002360050067","volume":"33","author":"R. Milner","year":"1996","unstructured":"R. Milner. Calculi for interaction. Acta Informatica, 33:707\u2013737, 1996.","journal-title":"Acta Informatica"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U. Montanari","year":"1995","unstructured":"U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545\u2013596, 1995.","journal-title":"Acta Informatica"},{"key":"3_CR26","unstructured":"U. Montanari and F. Rossi. Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures, 1998. To appear."},{"key":"3_CR27","unstructured":"M. Pfender. Universal algebra in s-monoidal categories. Technical Report 9522, University of Munich-Department of Mathematics, 1974."},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"J. Power","year":"1998","unstructured":"J. Power and E. Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7:453\u2013468, 1998.","journal-title":"Mathematical Structures in Computer Science"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90034-X","volume":"79","author":"E. Robinson","year":"1988","unstructured":"E. Robinson and G. Rosolini. Categories of partial maps. Information and Computation, 79:95\u2013130, 1988.","journal-title":"Categories of partial maps. Information and Computation"},{"key":"3_CR30","unstructured":"V. Sassone. On the Semantics of Petri Nets: Processes, Unfolding and Infinite Computations. PhD thesis, University of Pisa-Department of Computer Science, 1994."},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0304-3975(96)80709-2","volume":"170","author":"V. Sassone","year":"1996","unstructured":"V. Sassone. An axiomatization of the algebra of Petri net concatenable processes. Theoret. Comput. Sci., 170:277\u2013296, 1996.","journal-title":"Theoret. Comput. Sci"},{"key":"3_CR32","volume-title":"Term Graph Rewriting: Theory and Practice","author":"M.R. Sleep","year":"1993","unstructured":"M.R. Sleep, M.J. Plasmeijer, and M.C. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. Wiley, London, 1993."},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(87)90114-9","volume":"52","author":"G. Stefanescu","year":"1987","unstructured":"G. Stefanescu. On flowchart theories: Part II. The nondeterministic case. Theoret. Comput. Sci., 52:307\u2013340, 1987.","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR34","unstructured":"G. Stefanescu. Algebra of flownomials. Technical Report SFB-Bericht 342\/16\/94 A, Technical University of M\u00fcnchen, Institut f\u00fcr Informatik, 1994."}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48483-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T11:24:47Z","timestamp":1711365887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48483-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662464","9783540484837"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-48483-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}