{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T17:40:26Z","timestamp":1738258826866,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":58,"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_31","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T06:58:16Z","timestamp":1213081096000},"page":"503-509","source":"Crossref","is-referenced-by-count":0,"title":["Models of Computation: A Tribute to Ugo Montanari\u2019s Vision"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimiro","family":"Sassone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-540-40020-2_8","volume-title":"Recent Trends in Algebraic Development Techniques","author":"P. Baldan","year":"2003","unstructured":"Baldan, P., Bruni, R., Montanari, U.: Pre-nets, read arcs and unfolding: A functorial presentation. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol.\u00a02755, pp. 145\u2013164. Springer, Heidelberg (2003)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-49019-1_6","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Baldan","year":"1999","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Unfolding and event structure semantics for graph grammars. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 73\u201389. Springer, Heidelberg (1999)"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3060","volume":"171","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures, and processes. Inform. and Comput.\u00a0171(1), 1\u201349 (2001)","journal-title":"Inform. and Comput."},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2005.02.003","volume":"127","author":"P. Baldan","year":"2005","unstructured":"Baldan, P., Corradini, A., Montanari, U.: Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs. Elect. Notes in Th. Comput. Sci.\u00a0127(2), 5\u201328 (2005)","journal-title":"Elect. Notes in Th. Comput. Sci."},{"issue":"5","key":"31_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.ic.2006.11.004","volume":"205","author":"P. Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Unfolding semantics of graph transformation. Inform. and Comput.\u00a0205(5), 733\u2013782 (2007)","journal-title":"Inform. and Comput."},{"key":"31_CR6","first-page":"69","volume-title":"Proc. of LICS 2006","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS 2006, pp. 69\u201380. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/11539452_30","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"R. Bruni","year":"2005","unstructured":"Bruni, R., Butler, M.J., Ferreira, C., Hoare, C.A.R., Melgratti, H.C., Montanari, U.: Comparing two approaches to compensable flow composition. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 383\u2013397. Springer, Heidelberg (2005)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44618-4_20","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R. Bruni","year":"2000","unstructured":"Bruni, R., de Frutos-Escrig, D., Mart\u00ed-Oliet, N., Montanari, U.: Bisimilarity congruences for open terms and term graphs via tile logic. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"issue":"2","key":"31_CR9","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. Theoret. Comput. Sci.\u00a0286(2), 247\u2013292 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11539452_24","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"R. Bruni","year":"2005","unstructured":"Bruni, R., Gadducci, F., Montanari, U., Sobocinski, P.: Deriving weak bisimulation congruences from reduction systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 293\u2013307. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2006.07.005","volume":"366","author":"R. Bruni","year":"2006","unstructured":"Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theoret. Comput. Sci.\u00a0366(1-2), 98\u2013120 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-27755-2_7","volume-title":"Lectures on Concurrency and Petri Nets","author":"R. Bruni","year":"2004","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Extending the zero-safe approach to coloured, reconfigurable and dynamic nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 291\u2013327. Springer, Heidelberg (2004)"},{"key":"31_CR13","first-page":"563","volume-title":"Proc. of IFIP TCS 2004","author":"R. Bruni","year":"2004","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Nested commits for mobile calculi: Extending join. In: Proc. of IFIP TCS 2004, pp. 563\u2013576. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11817949_20","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R. Bruni","year":"2006","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Event structure semantics for nominal calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 295\u2013309. Springer, Heidelberg (2006)"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Event structure semantics for dynamic graph grammars. In: Proc. of PNGT 2006. Elect. Communic. of the EASST, vol.\u00a02, EASST (2007)","DOI":"10.1007\/11817949_20"},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1017\/S0960129501003462","volume":"12","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Meseguer, J., Montanari, U.: Symmetric monoidal and cartesian double categories as a semantic framework for tile logic. Math. Struct. in Comput. Sci.\u00a012(1), 53\u201390 (2002)","journal-title":"Math. Struct. in Comput. Sci."},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1006\/inco.2001.3050","volume":"170","author":"R. Bruni","year":"2001","unstructured":"Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Functorial models for Petri nets. Inform. and Comput.\u00a0170(2), 207\u2013236 (2001)","journal-title":"Inform. and Comput."},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/978-3-540-45208-9_21","volume-title":"Theoretical Computer Science","author":"R. Bruni","year":"2003","unstructured":"Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Algebraic theories for contextual pre-nets. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol.\u00a02841, pp. 256\u2013270. Springer, Heidelberg (2003)"},{"key":"31_CR19","first-page":"246","volume-title":"Proc. of LICS 1999","author":"R. Bruni","year":"1999","unstructured":"Bruni, R., Montanari, U.: Cartesian closed double categories, their lambda-notation, and the pi-calculus. In: Proc. of LICS 1999, pp. 246\u2013265. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1-2","key":"31_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1006\/inco.1999.2819","volume":"156","author":"R. Bruni","year":"2000","unstructured":"Bruni, R., Montanari, U.: Zero-safe nets: Comparing the collective and individual token approaches. Inform. and Comput.\u00a0156(1-2), 46\u201389 (2000)","journal-title":"Inform. and Comput."},{"issue":"1\u20132","key":"31_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(02)00011-7","volume":"281","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Montanari, U.: Dynamic connectors for concurrency. Theoret. Comput. Sci.\u00a0281(1\u20132), 131\u2013176 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"31_CR22","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1017\/S1471068401000035","volume":"1","author":"R. Bruni","year":"2001","unstructured":"Bruni, R., Montanari, U., Rossi, F.: An interactive semantics of logic programming. Theory and Practice of Logic Programming\u00a01(6), 647\u2013690 (2001)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2-3","key":"31_CR23","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2004.10.044","volume":"335","author":"R. Bruni","year":"2005","unstructured":"Bruni, R., Montanari, U., Sassone, V.: Observational congruences for dynamically reconfigurable tile systems. Theoret. Comput. Sci.\u00a0335(2-3), 331\u2013372 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-45022-X_15","volume-title":"Automata, Languages and Programming","author":"R. Bruni","year":"2000","unstructured":"Bruni, R., Sassone, V.: Algebraic models for contextual nets. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 175\u2013186. Springer, Heidelberg (2000)"},{"issue":"1","key":"31_CR25","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":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BFb0000097","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"I. Castellani","year":"1983","unstructured":"Castellani, I., Montanari, U.: Graph grammars for distributed systems. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph Grammars 1982. LNCS, vol.\u00a0153, pp. 20\u201338. Springer, Heidelberg (1983)"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Coccia, M., Gadducci, F., Montanari, U.: GS-lambda theories: A syntax for higher-order graphs. Elect. Notes in Th. Comput. Sci.\u00a069 (2002)","DOI":"10.1016\/S1571-0661(04)80560-7"},{"key":"31_CR28","series-title":"IFIP Transactions","first-page":"423","volume-title":"Pro. of PROCOMET 1994","author":"A. Corradini","year":"1994","unstructured":"Corradini, A., Ehrig, H., L\u00f6we, M., Montanari, U., Rossi, F.: An event structure semantics for safe graph grammars. In: Pro. of PROCOMET 1994. IFIP Transactions, vol.\u00a0A-56, pp. 423\u2013444. North-Holland, Amsterdam (1994)"},{"key":"31_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48321-7_2","volume-title":"Fundamentals of Computation Theory","author":"A. Corradini","year":"1999","unstructured":"Corradini, A., Heckel, R., Montanari, U.: Tile transition systems as structured coalgebras. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 13\u201338. Springer, Heidelberg (1999)"},{"key":"31_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(92)90087-V","volume":"103","author":"A. Corradini","year":"1992","unstructured":"Corradini, A., Montanari, U.: An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci.\u00a0103, 51\u2013106 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"31_CR31","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. Theoret. Comput. Sci.\u00a0122(1\u20132), 165\u2013200 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/BFb0035764","volume-title":"Automata, Languages and Programming","author":"P. Darondeau","year":"1989","unstructured":"Darondeau, P., Degano, P.: Causal trees. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 234\u2013248. Springer, Heidelberg (1989)"},{"issue":"7","key":"31_CR33","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s002360050064","volume":"33","author":"P. Degano","year":"1996","unstructured":"Degano, P., Meseguer, J., Montanari, U.: Axiomatizing the algebra of net computations and processes. Acta Inform.\u00a033(7), 641\u2013667 (1996)","journal-title":"Acta Inform."},{"issue":"2","key":"31_CR34","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/23005.24038","volume":"34","author":"P. Degano","year":"1987","unstructured":"Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. Journal of the ACM\u00a034(2), 411\u2013449 (1987)","journal-title":"Journal of the ACM"},{"issue":"4","key":"31_CR35","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/990010.990013","volume":"12","author":"G.L. Ferrari","year":"2003","unstructured":"Ferrari, G.L., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. ACM Transactions on Software Engineering and Methodology\u00a012(4), 440\u2013473 (2003)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"31_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11804192_2","volume-title":"Formal Methods for Components and Objects","author":"G.L. Ferrari","year":"2006","unstructured":"Ferrari, G.L., Hirsch, D., Lanese, I., Montanari, U., Tuosto, E.: Synchronised hyperedge replacement as a model for service oriented computing. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol.\u00a04111, pp. 22\u201343. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"31_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2018-1692","volume":"34","author":"G.L. Ferrari","year":"1998","unstructured":"Ferrari, G.L., Montanari, U.: Parameterized structured operational semantics. Fundam. Inform\u00a034(1-2), 1\u201331 (1998)","journal-title":"Fundam. Inform"},{"issue":"1\/2","key":"31_CR38","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1999.2825","volume":"156","author":"G.L. Ferrari","year":"2000","unstructured":"Ferrari, G.L., Montanari, U.: Tile formats for located and mobile systems. Inform. and Comput.\u00a0156(1\/2), 173\u2013235 (2000)","journal-title":"Inform. and Comput."},{"issue":"3","key":"31_CR39","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1017\/S0960129597002284","volume":"7","author":"G.L. Ferrari","year":"1997","unstructured":"Ferrari, G.L., Montanari, U., Mowbray, M.: Structured transition systems with parametric observations: observational congruences and minimal realizations. Math. Struct. in Comput. Sci.\u00a07(3), 241\u2013282 (1997)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"31_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45446-2_1","volume-title":"Theoretical Computer Science","author":"G.L. Ferrari","year":"2001","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E.: A LTS semantics of ambients via graph synchronization with mobility. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 1\u201316. Springer, Heidelberg (2001)"},{"key":"31_CR41","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7551\/mitpress\/5641.003.0010","volume-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","author":"F. Gadducci","year":"2000","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133\u2013166. MIT Press, Cambridge (2000)"},{"issue":"2","key":"31_CR42","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. Theoret. Comput. Sci.\u00a0285(2), 319\u2013358 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR43","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)"},{"issue":"2&3","key":"31_CR44","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(90)90035-G","volume":"72","author":"R. Gorrieri","year":"1990","unstructured":"Gorrieri, R., Marchetti, S., Montanari, U.: A2CCS: Atomic actions for CCS. Theoret. Comput. Sci.\u00a072(2&3), 203\u2013223 (1990)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45263-X_10","volume-title":"Coordination Languages and Models","author":"D. Hirsch","year":"2000","unstructured":"Hirsch, D., Inverardi, P., Montanari, U.: Reconfiguration of software architecture styles with name mobility. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol.\u00a01906, pp. 148\u2013163. Springer, Heidelberg (2000)"},{"key":"31_CR46","series-title":"Lecture Notes in Computer Science","first-page":"121","volume-title":"CONCUR 2001 - Concurrency Theory","author":"D. Hirsch","year":"2001","unstructured":"Hirsch, D., Montanari, U.: Synchronized hyperedge replacement with name mobility. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 121\u2013136. Springer, Heidelberg (2001)"},{"key":"31_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45500-0_7","volume-title":"Theoretical Aspects of Computer Software","author":"B. K\u00f6nig","year":"2001","unstructured":"K\u00f6nig, B., Montanari, U.: Observational equivalence for synchronized graph rewriting with mobility. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 145\u2013164. Springer, Heidelberg (2001)"},{"issue":"2","key":"31_CR48","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.entcs.2005.03.032","volume":"154","author":"I. Lanese","year":"2006","unstructured":"Lanese, I., Montanari, U.: Hoare vs Milner: Comparing synchronizations in a graphical framework with mobility. Elect. Notes in Th. Comput. Sci.\u00a0154(2), 55\u201372 (2006)","journal-title":"Elect. Notes in Th. Comput. Sci."},{"issue":"3","key":"31_CR49","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S0960129500000980","volume":"6","author":"C. Laneve","year":"1996","unstructured":"Laneve, C., Montanari, U.: Axiomatizing permutation equivalence. Math. Struct. in Comput. Sci.\u00a06(3), 219\u2013249 (1996)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"31_CR50","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Transactions on Programming Languages and Systems\u00a04, 258\u2013282 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"31_CR51","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. Theoret. Comput. Sci.\u00a096, 73\u2013155 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR52","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J. Meseguer","year":"1990","unstructured":"Meseguer, J., Montanari, U.: Petri nets are monoids. Inform. and Comput.\u00a088, 105\u2013155 (1990)","journal-title":"Inform. and Comput."},{"key":"31_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-64299-4_27","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"Meseguer, J., Montanari, U.: Mapping tile logic into rewriting logic. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 62\u201391. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"31_CR54","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(95)00121-2","volume":"153","author":"J. Meseguer","year":"1996","unstructured":"Meseguer, J., Montanari, U., Sassone, V.: Process versus unfolding semantics for place\/transition Petri nets. Theoretical Computer Science\u00a0153(1\u20132), 171\u2013210 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"31_CR55","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1017\/S0960129597002314","volume":"7","author":"J. Meseguer","year":"1997","unstructured":"Meseguer, J., Montanari, U., Sassone, V.: On the semantics of place\/transition Petri nets. Math. Struct. in Comput. Sci.\u00a07(4), 359\u2013397 (1997)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"31_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BFb0052092","volume-title":"Foundations of Computer Science","author":"J. Meseguer","year":"1997","unstructured":"Meseguer, J., Montanari, U., Sassone, V.: Representation theorems for Petri nets. In: Freksa, C., Jantzen, M., Valk, R. (eds.) Foundations of Computer Science. LNCS, vol.\u00a01337, pp. 239\u2013249. Springer, Heidelberg (1997)"},{"issue":"3","key":"31_CR57","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":"4","key":"31_CR58","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/A:1008693303228","volume":"7","author":"F. Rossi","year":"1999","unstructured":"Rossi, F., Montanari, U.: Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures\u00a07(4), 333\u2013370 (1999)","journal-title":"Applied Categorical Structures"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T17:15:53Z","timestamp":1738257353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}