( en | de | ru )

 

Disambiguation of "Sammartino, Matteo"

Author of the publication

copydeleteadd this publication to your clipboard
Reconfigurable and Software-Defined Networks of Connectors and Components.

, , and . The ASCENS Approach, volume 8998 of Lecture Notes in Computer Science, Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matteo Garavoglia

Matteo Bertini

Matteo Rini

Marco Matteo

Matteo Gabba

 

Other publications of authors with the same name

A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours., and . TGC, volume 8902 of Lecture Notes in Computer Science, page 97-111. Springer, (2014)Algebras for Tree Decomposable Graphs., , and . ICGT, volume 12150 of Lecture Notes in Computer Science, page 203-220. Springer, (2020)From Local to Global Knowledge and Back., , , , and . The ASCENS Approach, volume 8998 of Lecture Notes in Computer Science, Springer, (2015)A coalgebraic semantics for causality in Petri nets., , and . J. Log. Algebraic Methods Program., 84 (6): 853-883 (2015)A network-conscious π-calculus and its coalgebraic semantics., and . Theor. Comput. Sci., (2014)Learning nominal automata., , , , and . POPL, page 613-625. ACM, (2017)Symbolic Register Automata., , , and . CAV (1), volume 11561 of Lecture Notes in Computer Science, page 3-21. Springer, (2019)CALF: Categorical Automata Learning Framework., , and . CSL, volume 82 of LIPIcs, page 29:1-29:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Tree Automata as Algebras: Minimisation and Determinisation., , , , and . CALCO, volume 139 of LIPIcs, page 6:1-6:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Symbolic Register Automata., , , and . CoRR, (2018)