• G.van Heerdt, M.Sammartino, A.Silva. CALF: Categorical Automata Learning Framework. CSL 2017, Stockholm, Sweden (pdf)
  • J.Moerman, M.Sammartino, A.Silva, B.Klin, M.Szynwelski. Learning Nominal Automata. POPL 2017, Paris, France. (pdf)
  • N.Hoch, U.Montanari and M.Sammartino. Dynamic Programming on Nominal Graphs. GaM 2015, London, UK. (pdf)
  • U.Montanari and M.Sammartino. Network-Conscious π-calculus – A Model of Pastry. LSFA 2014, Brasilia, Brazil.(pdf)
  • V.Ciancia and M.Sammartino. A class of automata for the verification
    of infinite, resource-allocating behaviours
    . TCG 2014, Rome, Italy.(pdf)
  • V.Ciancia and M.Sammartino. Nominal deterministic omega-automata.
    Accepted at MeMo 2014, Berlin, Germany.(pdf)
  • U.Montanari and M.Sammartino. Network Conscious pi-calculus: a Concurrent Semantics. MFPS 2012, Baths, UK.(pdf)


  • R.Bruni, U.Montanari and M.Sammartino. A coalgebraic semantics for causality in Petri netsJournal of Logical and Algebraic Methods in Programming, 2015 (pdf)
  • R.Bruni, U.Montanari and M.Sammartino. Revisiting causality, coalgebraically. Acta Informatica, 2015 (pdf)
  • U.Montanari and M.Sammartino. A network-conscious pi-calculus and its coalgebraic semantics. Theoretical Computer Science, 2014. (pdf)

Book Chapters

  • R.Bruni, U.Montanari and M.Sammartino. Reconfigurable and Software-Defined Networks of Connectors and Components. The ASCENS Approach 2015 (web)
  • N.Hoch, V.Monreale, U.Montanari, M.Sammartino, A.Tcheukam Siwe.
    From Local to Global Knowledge and Back. The ASCENS Approach 2015


  • G.van Heerdt, M.Sammartino and A.Silva.Learning Automata with Side-effects. (arxiv)
  • V.Ciancia and M.Sammartino. A decidable class of (nominal) omega-regular languages over an infinite alphabet. (arxiv)
  • M.Sammartino. A Network-Aware Process Calculus for Global Computing and
    its Categorical Framework
    . PhD thesis, University of
    Pisa, 2013. (pdf)
%d bloggers like this: