CPO Models for Infinite Term Rewriting. - Andrea Corradini 001; Fabio Gadducci (AMAST, 1995)

Modal mu-Types for Processes - Marino Miculan; Fabio Gadducci (LICS, 1995)

Relating Two Categorial Models of Term Rewriting. - Andrea Corradini 001; Fabio Gadducci; Ugo Montanari (RTA, 1995)

Tiles, rewriting rules and CCS. - Fabio Gadducci; Ugo Montanari (WRLA, 1996)

A 2-Categorical Presentation of Term Graph Rewriting. - Andrea Corradini 001; Fabio Gadducci (Category Theory and Computer Science, 1997)

An inductive view of graph transformation. - Fabio Gadducci; Reiko Heckel (WADT, 1997)

Rational Term Rewriting. - Andrea Corradini 001; Fabio Gadducci (FoSSaCS, 1998)

Axioms for Contextual Net Processes. - Fabio Gadducci; Ugo Montanari (ICALP, 1998)

A Fully Abstract Model for Graph-Interpreted Temporal Logic. - Fabio Gadducci; Reiko Heckel; Manuel Koch (TAGT, 1998)

Normal Forms for Partitions and Relations. - Roberto Bruni 001; Fabio Gadducci; Ugo Montanari (WADT, 1998)

Functorial Semantics for Multi-algebras. - Andrea Corradini 001; Fabio Gadducci (WADT, 1998)

CCS semantics via proved transition systems and rewriting logic. - Georgia Carabetta; Pierpaolo Degano; Fabio Gadducci (WRLA, 1998)

An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories. - Andrea Corradini 001; Fabio Gadducci (Appl. Categorical Struct., 1999)

Rewriting on cyclic structures: Equivalence between the operational and the categorical description. - Andrea Corradini 001; Fabio Gadducci (RAIRO Theor. Informatics Appl., 1999)

A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting. - Fabio Gadducci; Reiko Heckel; Mercè Llabrés (CTCS, 1999)

The tile model. - Fabio Gadducci; Ugo Montanari (Proof, Language, and Interaction, 2000)

Some algebraic laws for spans. - Roberto Bruni 001; Fabio Gadducci (RelMiS, 2001)

Categorical rewriting of term-like structures. - Andrea Corradini 001; Fabio Gadducci (GETGRATS Closing Workshop, 2001)

Comparing cospan-spans and tiles via a Hoare-style process calculus. - Fabio Gadducci; Piergiulio Katis; Ugo Montanari; Nicoletta Sabadini; Robert F. C. Walters (TOSCA, 2001)

A Concurrent Graph Semantics for Mobile Ambients. - Fabio Gadducci; Ugo Montanari (MFPS, 2001)

AGILE: Software Architecture for Mobility. - Luís Andrade 001; Paolo Baldan; Hubert Baumeister; Roberto Bruni 001; Andrea Corradini 001; Rocco De Nicola; José Luiz Fiadeiro; Fabio Gadducci; Stefania Gnesi; Piotr Hoffman; Nora Koch; Piotr Kosiuczenko; et al. (WADT, 2002)

GS.Lambda Theories: A Syntax for Higher-Order Graphs. - Matteo Coccia; Fabio Gadducci; Ugo Montanari (CTCS, 2002)

Inequational Deduction as Term Graph Rewriting. - Andrea Corradini 001; Fabio Gadducci; Wolfram Kahl; Barbara König 001 (TERMGRAPH, 2002)

Preface - WRLA 2002, Rewriting Logic and Its Applications, Pisa, Italy, 19-21 September 2002. - Fabio Gadducci; Ugo Montanari (WRLA, 2002)

Normal forms for algebras of connection. - Roberto Bruni 001; Fabio Gadducci; Ugo Montanari (Theor. Comput. Sci., 2002)

A functorial semantics for multi-algebras and partial algebras, with applications to syntax. - Andrea Corradini 001; Fabio Gadducci (Theor. Comput. Sci., 2002)

A causal semantics for CCS via rewriting logic. - Pierpaolo Degano; Fabio Gadducci; Corrado Priami (Theor. Comput. Sci., 2002)

Comparing logics for rewriting: rewriting logic, action calculi and tile logic. - Fabio Gadducci; Ugo Montanari (Theor. Comput. Sci., 2002)

Term Graph Rewriting for the pi-Calculus. - Fabio Gadducci (APLAS, 2003)

Causality and Replication in Concurrent Processes. - Pierpaolo Degano; Fabio Gadducci; Corrado Priami (Ershov Memorial Conference, 2003)

Denotational Testing Semantics in Coinductive Form. - Michele Boreale; Fabio Gadducci (MFCS, 2003)

Some Characterization Results for Permutation Algebras. - Fabio Gadducci; Marino Miculan; Ugo Montanari (COMETA, 2003)

Specifying and Verifying UML Activity Diagrams Via Graph Transformation. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci (Global Computing, 2004)

On Term Graphs as an Adhesive Category. - Andrea Corradini 001; Fabio Gadducci (TERMGRAPH, 2004)

Graph Processes with Fusions: Concurrency by Colimits, Again. - Fabio Gadducci; Ugo Montanari (Formal Methods in Software and Systems Modeling, 2005)

Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes. - Fabio Gadducci; Ugo Montanari (Processes, Terms and Cycles, 2005)

Deriving Weak Bisimulation Congruences from Reduction Systems. - Roberto Bruni 001; Fabio Gadducci; Ugo Montanari; Pawel Sobocinski 001 (CONCUR, 2005)

Graphical Verification of a Spatial Logic for the pi-calculus. - Fabio Gadducci; Alberto Lluch-Lafuente (GT-VC@CONCUR, 2005)

Concurrent Rewriting for Graphs with Equivalences. - Paolo Baldan; Fabio Gadducci; Ugo Montanari (CONCUR, 2006)

Enhancing Constraints Manipulation in Semiring-Based Formalisms. - Stefano Bistarelli; Fabio Gadducci (ECAI, 2006)

Graph Transactions as Processes. - Paolo Baldan; Andrea Corradini 001; Luciana Foss; Fabio Gadducci (ICGT, 2006)

Process Bisimulation Via a Graphical Encoding. - Filippo Bonchi; Fabio Gadducci; Barbara König 001 (ICGT, 2006)

Towards a Notion of Transaction in Graph Rewriting. - Paolo Baldan; Andrea Corradini 001; Fernando Luís Dotti; Luciana Foss; Fabio Gadducci; Leila Ribeiro 001 (GT-VMT@ETAPS, 2006)

Modelling Calculi with Name Mobility using Graphs with Equivalences. - Paolo Baldan; Fabio Gadducci; Ugo Montanari (TERMGRAPH@ETAPS, 2006)

Preface. - Maurice H. ter Beek; Fabio Gadducci (VODCA@FOSAD, 2006)

A Calculus for Team Automata. - Maurice H. ter Beek; Fabio Gadducci; Dirk Janssens (SBMF, 2006)

About permutation algebras, (pre)sheaves and named sets. - Fabio Gadducci; Marino Miculan; Ugo Montanari (High. Order Symb. Comput., 2006)

Processes as formal power series: A coinductive approach to denotational semantics. - Michele Boreale; Fabio Gadducci (Theor. Comput. Sci., 2006)

Graphical Encoding of a Spatial Logic for the pi -Calculus. - Fabio Gadducci; Alberto Lluch-Lafuente (CALCO, 2007)

A Behavioural Congruence for Web Services. - Filippo Bonchi; Antonio Brogi; Sara Corfini; Fabio Gadducci (FSEN, 2007)

Graph rewriting for the pi-calculus. - Fabio Gadducci (Math. Struct. Comput. Sci., 2007)

Petri Nets Are Dioids. - Paolo Baldan; Fabio Gadducci (AMAST, 2008)

Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study. - Filippo Bonchi; Antonio Brogi; Sara Corfini; Fabio Gadducci (Petri Nets, 2008)

A Category of Explicit Fusions. - Filippo Bonchi; Maria Grazia Buscemi; Vincenzo Ciancia; Fabio Gadducci (Concurrency, Graphs and Models, 2008)

Ugo Montanari and Friends. - Fabio Gadducci (Concurrency, Graphs and Models, 2008)

Parallel and Sequential Independence for Borrowed Contexts. - Filippo Bonchi; Fabio Gadducci; Tobias Heindel (ICGT, 2008)

A Decentralized Implementation of Mobile Ambients. - Fabio Gadducci; Giacoma Valentina Monreale (ICGT, 2008)

A Soft Approach to Multi-objective Optimization. - Stefano Bistarelli; Fabio Gadducci; Javier Larrosa; Emma Rollon (ICLP, 2008)

A Term-Graph Syntax for Algebras over Multisets. - Fabio Gadducci (WADT, 2008)

Preface. - Alessandro Aldini; Maurice H. ter Beek; Fabio Gadducci (VODCA@FOSAD, 2008)

Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding). - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (EXPRESS, 2008)

On the Use of Behavioural Equivalences for Web Services' Development. - Filippo Bonchi; Antonio Brogi; Sara Corfini; Fabio Gadducci (Fundam. Informaticae, 2008)

Encoding Asynchronous Interactions Using Open Petri Nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci (CONCUR, 2009)

Reactive Systems, Barbed Semantics, and the Mobile Ambients. - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (FoSSaCS, 2009)

A Graph Syntax for Processes and Services. - Roberto Bruni 001; Fabio Gadducci; Alberto Lluch-Lafuente (WS-FM, 2009)

On Barbs and Labels in Reactive Systems - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (SOS, 2009)

A Note on an Old-Fashioned Algebra for (Disconnected) Graphs. - Fabio Gadducci (TERMGRAPH@ETAPS, 2009)

A Net-based Approach to Web Services Publication and Replaceability. - Filippo Bonchi; Antonio Brogi; Sara Corfini; Fabio Gadducci (Fundam. Informaticae, 2009)

Synthesising CCS bisimulation using graph rewriting. - Filippo Bonchi; Fabio Gadducci; Barbara König 001 (Inf. Comput., 2009)

Concurrency Can't Be Observed, Asynchronously. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (APLAS, 2010)

On GS-Monoidal Theories for Graphs with Nesting. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Ugo Montanari (Graph Transformations and Model-Driven Engineering, 2010)

Saturated LTSs for Adhesive Rewriting Systems. - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale; Ugo Montanari (ICGT, 2010)

Counterpart Semantics for a Second-Order µ-Calculus. - Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (ICGT, 2010)

Extending Soft Arc Consistency Algorithms to Non-invertible Semirings. - Stefano Bistarelli; Fabio Gadducci; Javier Larrosa; Emma Rollon; Francesco Santini 001 (MICAI (1), 2010)

An Algebra of Hierarchical Graphs. - Roberto Bruni 001; Fabio Gadducci; Alberto Lluch-Lafuente (TGC, 2010)

An Institution for Graph Transformation. - Andrea Corradini 001; Fabio Gadducci; Leila Ribeiro 001 (WADT, 2010)

An Algebra of Hierarchical Graphs and its Application to Structural Encoding. - Roberto Bruni 001; Fabio Gadducci; Alberto Lluch-Lafuente (Sci. Ann. Comput. Sci., 2010)

From Petri Nets to Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci; Ugo Montanari (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Hierarchical Models for Service-Oriented Systems. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Ugo Montanari (Results of the SENSORIA Project, 2011)

Towards a General Theory of Barbs, Contexts and Labels. - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (APLAS, 2011)

Adhesivity Is Not Enough: Local Church-Rosser Revisited. - Paolo Baldan; Fabio Gadducci; Pawel Sobocinski 001 (MFCS, 2011)

A decentralised graphical implementation of mobile ambients. - Fabio Gadducci; Giacoma Valentina Monreale (J. Log. Algebraic Methods Program., 2011)

A Conceptual Framework for Adaptation. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (FASE, 2012)

Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models. - Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (ICGT, 2012)

A Modular LTS for Open Reactive Systems. - Fabio Gadducci; Giacoma Valentina Monreale; Ugo Montanari (IFIP TCS, 2012)

Adaptable Transition Systems. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (WADT, 2012)

Barbed Semantics for Open Reactive Systems. - Fabio Gadducci; Giacoma Valentina Monreale (WADT, 2012)

Local arc consistency for non-invertible semirings, with an application to multi-objective optimization. - Stefano Bistarelli; Fabio Gadducci; Javier Larrosa; Emma Rollon; Francesco Santini 001 (Expert Syst. Appl., 2012)

Counterpart Semantics for a Second-Order μ-Calculus. - Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (Fundam. Informaticae, 2012)

A Presheaf Environment for the Explicit Fusion Calculus. - Filippo Bonchi; Maria Grazia Buscemi; Vincenzo Ciancia; Fabio Gadducci (J. Autom. Reason., 2012)

Using Old Computers for Teaching Computer Science. - Giovanni A. Cignoni; Fabio Gadducci (HC, 2013)

Validating reconfigurations of reo circuits in an e-Banking scenario. - Maurice H. ter Beek; Fabio Gadducci; Francesco Santini 001 (ISARCS, 2013)

Soft Constraints for Lexicographic Orders. - Fabio Gadducci; Matthias M. Hölzl; Giacoma Valentina Monreale; Martin Wirsing (MICAI (1), 2013)

Adaptation is a Game. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (Adv. Math. Commun., 2013)

Preface. - Fabio Gadducci; Leonardo Mariani (J. Vis. Lang. Comput., 2013)

Encoding Synchronous Interactions Using Labelled Petri Nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (COORDINATION, 2014)

A Virtual Experience on the Very First Italian Computer. - Giovanni A. Cignoni; Fabio Gadducci; Stefano Paci (ACM Journal on Computing and Cultural Heritage, 2014)

RPO semantics for mobile ambients. - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (Math. Struct. Comput. Sci., 2014)

A General Theory of Barbs, Contexts, and Labels. - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (ACM Trans. Comput. Log., 2014)

Awareness and Control in Adaptable Transition Systems. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (PNSE @ Petri Nets, 2015)

Asynchronous Traces and Open Petri Nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (Programming Languages with Applications to Biology and Security, 2015)

A White Box Perspective on Behavioural Adaptation. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (Software, Services, and Systems, 2015)

A Labelled Semantics for Soft Concurrent Constraint Programming. - Fabio Gadducci; Francesco Santini 001; Luis Fernando Pino; Frank D. Valencia (COORDINATION, 2015)

Verification of Evolving Graph Structures (Dagstuhl Seminar 15451). - Parosh Aziz Abdulla; Fabio Gadducci; Barbara König 001; Viktor Vafeiadis (Dagstuhl Reports, 2015)

Concurrency cannot be observed, asynchronously. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (Math. Struct. Comput. Sci., 2015)

Modular encoding of synchronous and asynchronous interactions using open Petri nets. - Paolo Baldan; Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (Sci. Comput. Program., 2015)

Modelling and analyzing adaptive self-assembly strategies with Maude. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Alberto Lluch-Lafuente; Andrea Vandin (Sci. Comput. Program., 2015)

Reconciling White-Box and Black-Box Perspectives on Behavioral Self-adaptation. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Matthias M. Hölzl; Alberto Lluch-Lafuente; Andrea Vandin; Martin Wirsing (The ASCENS Approach, 2015)

Rewriting modulo symmetric monoidal structure. - Filippo Bonchi; Fabio Gadducci; Aleks Kissinger; Pawel Sobocinski 001; Fabio Zanasi (LICS, 2016)

A Denotational View of Replicated Data Types. - Fabio Gadducci; Hernán C. Melgratti; Christian Roldán (COORDINATION, 2017)

Confluence of Graph Rewriting with Interfaces. - Filippo Bonchi; Fabio Gadducci; Aleks Kissinger; Pawel Sobocinski 001; Fabio Zanasi (ESOP, 2017)

Domains and event structures for fusions. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci (LICS, 2017)

Residuation for bipolar preferences in soft constraints. - Fabio Gadducci; Francesco Santini 001 (Inf. Process. Lett., 2017)

Observational and behavioural equivalences for soft concurrent constraint programming. - Fabio Gadducci; Francesco Santini 001; Luis Fernando Pino; Frank D. Valencia (J. Log. Algebraic Methods Program., 2017)

Soft Constraint Automata with Memory. - Kasper Dokter; Fabio Gadducci; Francesco Santini 001 (It's All About Coordination, 2018)

Rewriting with Frobenius. - Filippo Bonchi; Fabio Gadducci; Aleks Kissinger; Pawel Sobocinski 001; Fabio Zanasi (LICS, 2018)

Event Structures for Petri nets with Persistence. - Paolo Baldan; Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Hernán C. Melgratti; Ugo Montanari (Log. Methods Comput. Sci., 2018)

On the semantics and implementation of replicated data types. - Fabio Gadducci; Hernán C. Melgratti; Christian Roldán (Sci. Comput. Program., 2018)

Polyadic Soft Constraints. - Filippo Bonchi; Laura Bussi; Fabio Gadducci; Francesco Santini 001 (The Art of Modelling Computational Systems, 2019)

Data-Driven Choreographies à la Klaim. - Roberto Bruni 001; Andrea Corradini 001; Fabio Gadducci; Hernán C. Melgratti; Ugo Montanari; Emilio Tuosto (Models, Languages, and Tools for Concurrent and Distributed Programming, 2019)

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

Petri nets are dioids: a new algebraic foundation for non-deterministic net theory. - Paolo Baldan; Fabio Gadducci (Acta Informatica, 2019)

Retracing and assessing the CEP project. - Giovanni A. Cignoni; Fabio Gadducci (CoRR, 2019)

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

Pisa, 1954-1961: Assessing Key Stages of a Seminal Italian Project. - Giovanni A. Cignoni; Fabio Gadducci (IEEE Ann. Hist. Comput., 2020)

A spatial model checker in GPU (extended version). - Laura Bussi; Vincenzo Ciancia; Fabio Gadducci (CoRR, 2020)

Towards Model Checking Video Streams Using VoxLogicA on GPUs. - Laura Bussi; Vincenzo Ciancia; Fabio Gadducci; Diego Latella; Mieke Massink (DataMod, 2021)

Towards a Spatial Model Checker on GPU. - Laura Bussi; Vincenzo Ciancia; Fabio Gadducci (FORTE, 2021)

Residuation for Soft Constraints: Lexicographic Orders and Approximation Techniques. - Fabio Gadducci; Francesco Santini 001 (JELIA, 2021)

Concurrent semantics for fusions: Weak prime domains and connected event structures. - Paolo Baldan; Andrea Corradini 001; Fabio Gadducci (Inf. Comput., 2021)

Soft constraint automata with memory. - Kasper Dokter; Fabio Gadducci; Benjamin Lion; Francesco Santini 001 (J. Log. Algebraic Methods Program., 2021)

A Presheaf Semantics for Quantified Temporal Logics. - Fabio Gadducci; Davide Trotta (WADT, 2022)

Soft Concurrent Constraint Programming with Local Variables. - Laura Bussi; Fabio Gadducci; Francesco Santini 001 (COORDINATION, 2022)

A new criterion for M, N-adhesivity, with an application to hierarchical graphs. - Davide Castelnovo; Fabio Gadducci; Marino Miculan (FoSSaCS, 2022)

Graph Rewriting Components. - Reiko Heckel; Andrea Corradini 001; Fabio Gadducci (ICGT, 2022)

On Binding in the Spatial Logics for Closure Spaces. - Laura Bussi; Vincenzo Ciancia; Fabio Gadducci; Diego Latella; Mieke Massink (ISoLA (1), 2022)

A new criterion for M, N-adhesivity, with an application to hierarchical graphs. - Davide Castelnovo; Fabio Gadducci; Marino Miculan (CoRR, 2022)

Completeness and expressiveness for gs-monoidal categories. - Andrea Corradini 001; Fabio Gadducci; Davide Trotta (CoRR, 2022)

Distributivity and residuation for lexicographic orders. - Fabio Gadducci; Francesco Santini 001 (Inf. Process. Lett., 2022)

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure. - Filippo Bonchi; Fabio Gadducci; Aleks Kissinger; Pawel Sobocinski 001; Fabio Zanasi (J. ACM, 2022)

Special issue on Application-oriented aspects of graphs and graph transformation (ICGT 2020). - Timo Kehrer; Fabio Gadducci (Sci. Comput. Program., 2022)

Special issue on Theoretical Topics in Graph Transformation. - Fabio Gadducci; Timo Kehrer (Theor. 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)

String diagram rewrite theory II: Rewriting with symmetric monoidal structure. - Filippo Bonchi; Fabio Gadducci; Aleks Kissinger; Pawel Sobocinski 001; Fabio Zanasi (Math. Struct. Comput. Sci., 2022)

String diagram rewrite theory III: Confluence with and without Frobenius. - Filippo Bonchi; Fabio Gadducci; Aleks Kissinger; Pawel Sobocinski 001; Fabio Zanasi (Math. Struct. Comput. Sci., 2022)

Weakly Markov Categories and Weakly Affine Monads. - Tobias Fritz; Fabio Gadducci; Paolo Perrone; Davide Trotta (CALCO, 2023)

A Spatial Logic with Time and Quantifiers. - Laura Bussi; Vincenzo Ciancia; Fabio Gadducci (DaLí, 2023)

Specification and Verification of a Linear-Time Temporal Logic for Graph Transformation. - Fabio Gadducci; Andrea Laretto; Davide Trotta (ICGT, 2023)

Weakly affine monads. - Tobias Fritz; Fabio Gadducci; Paolo Perrone; Davide Trotta (CoRR, 2023)

Specification and verification of a linear-time logic for graph transformation. - Fabio Gadducci; Andrea Laretto; Davide Trotta (CoRR, 2023)

From Gs-monoidal to Oplax Cartesian Categories: Constructions and Functorial Completeness. - Tobias Fritz; Fabio Gadducci; Davide Trotta; Andrea Corradini 001 (Appl. Categorical Struct., 2023)

Specification and modelling of computing systems through graphs and graph transformation. - Fabio Gadducci; Timo Kehrer (J. Log. Algebraic Methods Program., 2023)

Quantum Bisimilarity Is a Congruence Under Physically Admissible Schedulers. - Lorenzo Ceragioli; Fabio Gadducci; Giuseppe Lomurno; Gabriele Tedeschi (APLAS, 2024)

Left-Linear Rewriting in Adhesive Categories. - Paolo Baldan; Davide Castelnovo; Andrea Corradini 001; Fabio Gadducci (CONCUR, 2024)

Effect Semantics for Quantum Process Calculi. - Lorenzo Ceragioli; Fabio Gadducci; Giuseppe Lomurno; Gabriele Tedeschi (CONCUR, 2024)

Testing Quantum Processes. - Lorenzo Ceragioli; Fabio Gadducci; Giuseppe Lomurno; Gabriele Tedeschi (ISoLA (1), 2024)

Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic Observers. - Lorenzo Ceragioli; Fabio Gadducci; Giuseppe Lomurno; Gabriele Tedeschi (Proc. ACM Program. Lang., 2024)

A simple criterion for M,N-adhesivity. - Davide Castelnovo; Fabio Gadducci; Marino Miculan (Theor. Comput. Sci., 2024)

EGGs Are Adhesive! - Roberto Biondo; Davide Castelnovo; Fabio Gadducci (CALCO, 2025)

A Constraint Opinion Model. - Fabio Gadducci; Carlos Olarte; Frank Valencia (COORDINATION, 2025)

A taxonomy of categories for relations. - Cipriano Junior Cioffo; Fabio Gadducci; Davide Trotta (CoRR, 2025)

Counterpart-based Quantified Temporal Logics. - Fabio Gadducci; Andrea Laretto; Davide Trotta (J. Log. Algebraic Methods Program., 2026)