Models of Computation: A Tribute to Ugo Montanari’s Vision

  • Roberto Bruni
  • Vladimiro Sassone
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5065)


Ugo’s research activity in the area ofModels of Computation (MoC, for short) has been prominent, influential and broadly scoped. Ugo’s trademark is that undefinable ability to understand and distill computational aspects into new models as if you were reading them out of some evident connection between well-know models: only, most often, that connection is really visible only after Ugo shows the way. Like experienced sailors have trusted compasses and sextants to help them find the best routes to harbour, Ugo relies on a bag of favourite tools which he has used along the years to deliver a variety of contributions to the MoC area. To mention just three (in alphabetic order): algebraic techniques, concurrency theory, and unification mechanisms.

In this introductory contribution we would like to recall some of the influentialMoC models put forward by Ugo which cut across the three approaches. Before doing that, it is worth devoting some space to discuss the three aspects separately. Notably, the use of category theory is a pervasive common trait.


Logic Programming Operational Semantic Graph Grammar Abstract Data Type Algebraic Technique 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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. 2755, pp. 145–164. Springer, Heidelberg (2003)Google Scholar
  2. 2.
    Baldan, P., Corradini, A., Montanari, U.: Unfolding and event structure semantics for graph grammars. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 73–89. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  3. 3.
    Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures, and processes. Inform. and Comput. 171(1), 1–49 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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. 127(2), 5–28 (2005)CrossRefGoogle Scholar
  5. 5.
    Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Unfolding semantics of graph transformation. Inform. and Comput. 205(5), 733–782 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS 2006, pp. 69–80. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  7. 7.
    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. 3653, pp. 383–397. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Bruni, R., de Frutos-Escrig, D., Martí-Oliet, N., Montanari, U.: Bisimilarity congruences for open terms and term graphs via tile logic. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 259–274. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connections. Theoret. Comput. Sci. 286(2), 247–292 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    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. 3653, pp. 293–307. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theoret. Comput. Sci. 366(1-2), 98–120 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    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. 3098, pp. 291–327. Springer, Heidelberg (2004)Google Scholar
  13. 13.
    Bruni, R., Melgratti, H.C., Montanari, U.: Nested commits for mobile calculi: Extending join. In: Proc. of IFIP TCS 2004, pp. 563–576. Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  14. 14.
    Bruni, R., Melgratti, H.C., Montanari, U.: Event structure semantics for nominal calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 295–309. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  15. 15.
    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. 2, EASST (2007)Google Scholar
  16. 16.
    Bruni, R., Meseguer, J., Montanari, U.: Symmetric monoidal and cartesian double categories as a semantic framework for tile logic. Math. Struct. in Comput. Sci. 12(1), 53–90 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Functorial models for Petri nets. Inform. and Comput. 170(2), 207–236 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Algebraic theories for contextual pre-nets. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol. 2841, pp. 256–270. Springer, Heidelberg (2003)Google Scholar
  19. 19.
    Bruni, R., Montanari, U.: Cartesian closed double categories, their lambda-notation, and the pi-calculus. In: Proc. of LICS 1999, pp. 246–265. IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
  20. 20.
    Bruni, R., Montanari, U.: Zero-safe nets: Comparing the collective and individual token approaches. Inform. and Comput. 156(1-2), 46–89 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Bruni, R., Montanari, U.: Dynamic connectors for concurrency. Theoret. Comput. Sci. 281(1–2), 131–176 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Bruni, R., Montanari, U., Rossi, F.: An interactive semantics of logic programming. Theory and Practice of Logic Programming 1(6), 647–690 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Bruni, R., Montanari, U., Sassone, V.: Observational congruences for dynamically reconfigurable tile systems. Theoret. Comput. Sci. 335(2-3), 331–372 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Bruni, R., Sassone, V.: Algebraic models for contextual nets. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 175–186. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  25. 25.
    Buscemi, M.G., Montanari, U.: A compositional coalgebraic model of fusion calculus. J. Log. Algebr. Program 72(1), 78–97 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Castellani, I., Montanari, U.: Graph grammars for distributed systems. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph Grammars 1982. LNCS, vol. 153, pp. 20–38. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  27. 27.
    Coccia, M., Gadducci, F., Montanari, U.: GS-lambda theories: A syntax for higher-order graphs. Elect. Notes in Th. Comput. Sci. 69 (2002)Google Scholar
  28. 28.
    Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Rossi, F.: An event structure semantics for safe graph grammars. In: Pro. of PROCOMET 1994. IFIP Transactions, vol. A-56, pp. 423–444. North-Holland, Amsterdam (1994)Google Scholar
  29. 29.
    Corradini, A., Heckel, R., Montanari, U.: Tile transition systems as structured coalgebras. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 13–38. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  30. 30.
    Corradini, A., Montanari, U.: An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci. 103, 51–106 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  31. 31.
    Corradini, A., Montanari, U., Rossi, F.: An abstract machine for concurrent modular systems: CHARM. Theoret. Comput. Sci. 122(1–2), 165–200 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  32. 32.
    Darondeau, P., Degano, P.: Causal trees. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 234–248. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  33. 33.
    Degano, P., Meseguer, J., Montanari, U.: Axiomatizing the algebra of net computations and processes. Acta Inform. 33(7), 641–667 (1996)CrossRefMathSciNetGoogle Scholar
  34. 34.
    Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. Journal of the ACM 34(2), 411–449 (1987)CrossRefMathSciNetGoogle Scholar
  35. 35.
    Ferrari, G.L., Gnesi, S., Montanari, U., Pistore, M.: A model-checking verification environment for mobile processes. ACM Transactions on Software Engineering and Methodology 12(4), 440–473 (2003)CrossRefGoogle Scholar
  36. 36.
    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. 4111, pp. 22–43. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  37. 37.
    Ferrari, G.L., Montanari, U.: Parameterized structured operational semantics. Fundam. Inform 34(1-2), 1–31 (1998)zbMATHMathSciNetGoogle Scholar
  38. 38.
    Ferrari, G.L., Montanari, U.: Tile formats for located and mobile systems. Inform. and Comput. 156(1/2), 173–235 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  39. 39.
    Ferrari, G.L., Montanari, U., Mowbray, M.: Structured transition systems with parametric observations: observational congruences and minimal realizations. Math. Struct. in Comput. Sci. 7(3), 241–282 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  40. 40.
    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. 2202, pp. 1–16. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  41. 41.
    Gadducci, F., Montanari, U.: The tile model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133–166. MIT Press, Cambridge (2000)Google Scholar
  42. 42.
    Gadducci, F., Montanari, U.: Comparing logics for rewriting: rewriting logic, action calculi and tile logic. Theoret. Comput. Sci. 285(2), 319–358 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  43. 43.
    Giarratana, V., Gimona, F., Montanari, U.: Observability concepts in abstract data type specifications. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 576–587. Springer, Heidelberg (1976)Google Scholar
  44. 44.
    Gorrieri, R., Marchetti, S., Montanari, U.: A2CCS: Atomic actions for CCS. Theoret. Comput. Sci. 72(2&3), 203–223 (1990)CrossRefMathSciNetzbMATHGoogle Scholar
  45. 45.
    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. 1906, pp. 148–163. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  46. 46.
    Hirsch, D., Montanari, U.: Synchronized hyperedge replacement with name mobility. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 121–136. Springer, Heidelberg (2001)Google Scholar
  47. 47.
    König, B., Montanari, U.: Observational equivalence for synchronized graph rewriting with mobility. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 145–164. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  48. 48.
    Lanese, I., Montanari, U.: Hoare vs Milner: Comparing synchronizations in a graphical framework with mobility. Elect. Notes in Th. Comput. Sci. 154(2), 55–72 (2006)CrossRefGoogle Scholar
  49. 49.
    Laneve, C., Montanari, U.: Axiomatizing permutation equivalence. Math. Struct. in Comput. Sci. 6(3), 219–249 (1996)zbMATHMathSciNetCrossRefGoogle Scholar
  50. 50.
    Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4, 258–282 (1982)zbMATHCrossRefGoogle Scholar
  51. 51.
    Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96, 73–155 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  52. 52.
    Meseguer, J., Montanari, U.: Petri nets are monoids. Inform. and Comput. 88, 105–155 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  53. 53.
    Meseguer, J., Montanari, U.: Mapping tile logic into rewriting logic. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 62–91. Springer, Heidelberg (1998)Google Scholar
  54. 54.
    Meseguer, J., Montanari, U., Sassone, V.: Process versus unfolding semantics for place/transition Petri nets. Theoretical Computer Science 153(1–2), 171–210 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  55. 55.
    Meseguer, J., Montanari, U., Sassone, V.: On the semantics of place/transition Petri nets. Math. Struct. in Comput. Sci. 7(4), 359–397 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  56. 56.
    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. 1337, pp. 239–249. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  57. 57.
    Montanari, U., Pistore, M.: Structured coalgebras and minimal HD-automata for the pi-calculus. Theoret. Comput. Sci. 340(3), 539–576 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  58. 58.
    Rossi, F., Montanari, U.: Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures 7(4), 333–370 (1999)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Roberto Bruni
    • 1
  • Vladimiro Sassone
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaItalia
  2. 2.ECSUniversity of SouthamptonUK

Personalised recommendations