Advertisement

Ugo Montanari in a Nutshell

  • Rocco De Nicola
  • Pierpaolo Degano
  • José Meseguer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5065)

Abstract

Ugo was born in Besana Brianza in 1943 where his parents had moved to escape from the Milan bombings during the Second World War. Immediately after the war he went back to Milan were he completed all his studies. Ugo got his Laurea degree in Electronic Engineering from the Politecnico di Milano in 1966, three years before the first Laurea curriculum and seventeen years before the first PhD curriculum in Computer Science started in Pisa.

Keywords

Logic Programming Constraint Programming Graph Transformation Seminal Contribution Concurrency Theory 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Montanari, U.: Continuous Skeletons from Digitalized Images. Journal of the ACM 16(4), 534–549 (1969)zbMATHCrossRefGoogle Scholar
  2. 2.
    Galimberti, R., Montanari, U.: An Algorithm for Hidden Line Elimination. Communications of the ACM 12(4), 206–211 (1969)zbMATHCrossRefGoogle Scholar
  3. 3.
    Montanari, U.: Separable Graphs, Planar Graphs and Web Grammars. Information and Control 16(3), 243–267 (1970)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Montanari, U.: Heuristically Guided Search and Chromosome Matching. Artificial Intelligence 1, 227–245 (1970)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Montanari, U.: On the Optimal Detection of Curves in Noisy Pictures. Communications of the ACM 14(5) (1971)Google Scholar
  6. 6.
    Montanari, U.: Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences 7(2), 95–132 (1974)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Giarratana, V., Gimona, F., Montanari, U.: Observability Concepts in Abstract Data Type Specification. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, Springer, Heidelberg (1976)Google Scholar
  8. 8.
    Martelli, A., Montanari, U.: An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems 4(2), 258–282 (1982)zbMATHCrossRefGoogle Scholar
  9. 9.
    Degano, P., Montanari, U.: Liveness properties as convergence in metric spaces. In: 16th ACM Annual Symposium on Theory of Computing, pp. 31–38 (1984)Google Scholar
  10. 10.
    Degano, P., Montanari, U.: A Model of Distributed Systems Based on Graph Rewriting. Journal of the ACM 34(2), 411–449 (1987)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Degano, P., De Nicola, R., Montanari, U.: A Distributed Operational Semantics For CCS Based On Condition/Event Systems. Acta Informatica 26, 59–91 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Degano, P., De Nicola, R., Montanari, U.: Partial Orderings Descriptions and Observations of Nondeterministic Concurrent Processes. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 438–466. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  13. 13.
    Meseguer, J., Montanari, U.: Petri Nets are Monoids. Information and Computation 88(2), 105–155 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Corradini, A., Montanari, U.: An Algebraic Semantics for Structured Transition Systems and its Application to Logic Programs. TCS 103, 51–106 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Meseguer, J., Montanari, U., Sassone, V.: Process versus Unfolding Semantics for Place/Transition Petri Nets. TCS 153(1-2), 171–210 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Degano, P., Meseguer, J., Montanari, U.: Axiomatizing the Algebra of Net Computations and Processes. Acta Informatica 33(7), 641–667 (1996)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Corradini, A., Montanari, U., Rossi, F.: Graph Processes. Fundamenta Informaticae 26(3-4), 241–265 (1996)zbMATHMathSciNetGoogle Scholar
  18. 18.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-Based Constraint Satisfaction and Optimization. Journal of the ACM 44(2), 201–236 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    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
  20. 20.
    Bruni, R., Montanari, U.: Cartesian Closed Double Categories, their Lambda-Notation, and the π-Calculus. In: Proc. 14th Symposium on Logic in Computer Science, pp. 246–265. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  21. 21.
    Bruni, R., Montanari, U.: Zero-Safe Nets: Comparing the Collective and Individual Token Approaches. Information and Computation 156(1-2), 46–89 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Functorial Models for Petri Nets. Information and Computation 170, 207–236 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Baldan, P., Corradini, A., Montanari, U.: Contextual Petri Nets, Asymmetric Event Structures and Processes. Information and Computation 171, 1–49 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-Based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and Systems 23(1), 1–29 (2001)CrossRefGoogle Scholar
  25. 25.
    Bruni, R., Meseguer, J., Montanari, U.: Symmetric and Cartesian Double Categories as a Semantic Framework for Tile Logic. Mathematical Structures of Computer Science 12, 53–90 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Gadducci, F., Montanari, U.: Comparing Logics for Rewriting: Rewriting Logic, Action Calculi and Tile Logic. TCS 285(2), 319–358 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Ferrari, G., 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
  28. 28.
    Bruni, R., Montanari, U.: Concurrent Models for Linda with Transactions. Mathematical Structures of Computer Science 14(3), 421–468 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Bruni, R., Melgratti, H., Montanari, U.: Theoretical Foundations for Compensations in Flow Composition Languages. In: Abadi, M. (ed.) Proc. POPL 2005, pp. 209–220. ACM Press, New York (2005)CrossRefGoogle Scholar
  30. 30.
    Ferrari, G., Montanari, U., Tuosto, E.: Coalgebraic Minimization of HD-Automata for the π-Calculus Using Polymorphic Types. TCS 331(2-3), 325–365 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  31. 31.
    Montanari, U., Pistore, M.: Structured Coalgebras and Minimal HD-Automata for the π-Calculus. TCS 340(3), 539–576 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  32. 32.
    Lluch Lafuente, A., Montanari, U.: Quantitative μ-Calculus and CTL Defined over Constraint Semirings. TCS 346, 135–160 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  33. 33.
    Bistarelli, S., Montanari, U., Rossi, F.: Soft Concurrent Constraint Programming. ACM Transactions on Computational Logic 7(3), 1–27 (2006)CrossRefMathSciNetGoogle Scholar
  34. 34.
    Baldan, P., Corradini, A., Montanari, U., Ribeiro, L.: Unfolding Semantics of Graph Transformation. Information and Computation 205, 733–782 (2007)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Rocco De Nicola
    • 1
  • Pierpaolo Degano
    • 2
  • José Meseguer
    • 3
  1. 1.Dipartimento di Sistemi e InformaticaUniversità di Firenze 
  2. 2.Dipartimento di InformaticaUniversità di Pisa 
  3. 3.Department of Computer ScienceUniversity of Illinois, Urbana-Champaign 

Personalised recommendations