Network Conscious π-calculus: A Concurrent Semantics. - Ugo Montanari; Matteo Sammartino (MFPS, 2012)

A decidable class of (nominal) omega-regular languages over an infinite alphabet. - Vincenzo Ciancia; Matteo Sammartino (CoRR, 2013)

A Network-Aware Process Calculus for Global Computing and its Categorical Framework. - Matteo Sammartino (2013)

A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours. - Vincenzo Ciancia; Matteo Sammartino (TGC, 2014)

Network-Conscious π-calculus - A Model of Pastry. - Ugo Montanari; Matteo Sammartino (LSFA, 2014)

A network-conscious π-calculus and its coalgebraic semantics. - Ugo Montanari; Matteo Sammartino (Theor. Comput. Sci., 2014)

Causal Trees, Finally. - Roberto Bruni 001; Ugo Montanari; Matteo Sammartino (Programming Languages with Applications to Biology and Security, 2015)

Revisiting causality, coalgebraically. - Roberto Bruni 001; Ugo Montanari; Matteo Sammartino (Acta Informatica, 2015)

Dynamic Programming on Nominal Graphs. - Nicklas Hoch; Ugo Montanari; Matteo Sammartino (GaM, 2015)

A coalgebraic semantics for causality in Petri nets. - Roberto Bruni 001; Ugo Montanari; Matteo Sammartino (J. Log. Algebraic Methods Program., 2015)

Reconfigurable and Software-Defined Networks of Connectors and Components. - Roberto Bruni 001; Ugo Montanari; Matteo Sammartino (The ASCENS Approach, 2015)

From Local to Global Knowledge and Back. - Nicklas Hoch; Giacoma Valentina Monreale; Ugo Montanari; Matteo Sammartino; Alain Tcheukam Siwe (The ASCENS Approach, 2015)

CALF: Categorical Automata Learning Framework. - Gerco van Heerdt; Matteo Sammartino; Alexandra Silva 001 (CSL, 2017)

Learning nominal automata. - Joshua Moerman; Matteo Sammartino; Alexandra Silva 001; Bartek Klin; Michal Szynwelski (POPL, 2017)

Decomposition Structures for Soft Constraint Evaluation Problems: An Algebraic Approach. - Ugo Montanari; Matteo Sammartino; Alain Tcheukam Siwe (Graph Transformation, Specifications, and Nets, 2018)

SDN-Actors: Modeling and Verification of SDN Programs. - Elvira Albert; Miguel Gómez-Zamalloa; Albert Rubio; Matteo Sammartino; Alexandra Silva 001 (FM, 2018)

Tree Automata as Algebras: Minimisation and Determinisation. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Matteo Sammartino; Alexandra Silva 001 (CALCO, 2019)

Symbolic Register Automata. - Loris D'Antoni; Tiago Ferreira 001; Matteo Sammartino; Alexandra Silva 001 (CAV (1), 2019)

A Categorical Account of Replicated Data Types. - Fabio Gadducci; Hernán C. Melgratti; Christian Roldán; Matteo Sammartino (FSTTCS, 2019)

A (co)algebraic theory of succinct automata. - Gerco van Heerdt; Joshua Moerman; Matteo Sammartino; Alexandra Silva 001 (J. Log. Algebraic Methods Program., 2019)

Learning Automata with Side-Effects. - Gerco van Heerdt; Matteo Sammartino; Alexandra Silva 001 (CMCS, 2020)

Residual Nominal Automata. - Joshua Moerman; Matteo Sammartino (CONCUR, 2020)

Algebras for Tree Decomposable Graphs. - Roberto Bruni 001; Ugo Montanari; Matteo Sammartino (ICGT, 2020)

Implementation Correctness for Replicated Data Types, Categorically. - Fabio Gadducci; Hernán C. Melgratti; Christian Roldán; Matteo Sammartino (ICTAC, 2020)

Actor-Based Model Checking for SDN Networks. - Elvira Albert; Miguel Gómez-Zamalloa; Miguel Isabel; Albert Rubio; Matteo Sammartino; Alexandra Silva 001 (CoRR, 2020)

Bases for algebras over a monad. - Stefan Zetzsche; Alexandra Silva 001; Matteo Sammartino (CoRR, 2020)

Canonical automata via distributive law homomorphisms. - Stefan Zetzsche; Gerco van Heerdt; Alexandra Silva 001; Matteo Sammartino (MFPS, 2021)

Actor-based model checking for Software-Defined Networks. - Elvira Albert; Miguel Gómez-Zamalloa; Miguel Isabel; Albert Rubio; Matteo Sammartino; Alexandra Silva 001 (J. Log. Algebraic Methods Program., 2021)

A Categorical Framework for Learning Generalised Tree Automata. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Matteo Sammartino; Alexandra Silva 001 (CMCS, 2022)

ALARM: Active LeArning of Rowhammer Mitigations. - Amir Naseredini; Martin Berger 001; Matteo Sammartino; Shale Xiong (HASP@MICRO, 2022)

Guarded Kleene Algebra with Tests: Automata Learning. - Stefan Zetzsche; Alexandra Silva 001; Matteo Sammartino (MFPS, 2022)

Residuality and Learning for Nondeterministic Nominal Automata. - Joshua Moerman; Matteo Sammartino (Log. Methods Comput. Sci., 2022)

Categorical specification and implementation of Replicated Data Types. - Fabio Gadducci; Hernán C. Melgratti; Christian Roldán; Matteo Sammartino (Theor. Comput. Sci., 2022)

Generators and Bases for Monadic Closures. - Stefan Zetzsche; Alexandra Silva 001; Matteo Sammartino (CALCO, 2023)

Compositional Automata Learning of Synchronous Systems. - Thomas Neele; Matteo Sammartino (FASE, 2023)

Compositional Active Learning of Synchronizing Systems Through Automated Alphabet Refinement. - Léo Henry; Mohammad Reza Mousavi 001; Thomas Neele; Matteo Sammartino (CONCUR, 2025)

Compositional Active Learning of Synchronous Systems through Automated Alphabet Refinement. - Léo Henry; Thomas Neele; Mohammad Mousavi; Matteo Sammartino (CoRR, 2025)