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

Saturated Semantics for Reactive Systems. - Filippo Bonchi; Barbara König 001; Ugo Montanari (LICS, 2006)

Adhesive DPO Parallelism for Monic Matches. - Filippo Bonchi; Tobias Heindel (GT-VC@CONCUR, 2006)

A Coalgebraic Theory of Reactive Systems. - Filippo Bonchi; Ugo Montanari (LIX, 2006)

Coalgebraic Models for Reactive Systems. - Filippo Bonchi; Ugo Montanari (CONCUR, 2007)

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

G-Reactive Systems as Coalgebras. - Filippo Bonchi; Ugo Montanari (ACCAT@ETAPS, 2007)

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)

Symbolic Semantics Revisited. - Filippo Bonchi; Ugo Montanari (FoSSaCS, 2008)

Abstract Semantics by Observable Contexts. - Filippo Bonchi (ICGT, 2008)

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

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

Preface. - Filippo Bonchi; Davide Grohmann; Paola Spoletini; Angelo Troina; Emilio Tuosto (ICE@ICALP, 2008)

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

Abstract Semantics by Observable Contexts. - Filippo Bonchi (2008)

Coalgebraic Symbolic Semantics. - Filippo Bonchi; Ugo Montanari (CALCO, 2009)

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

Deriving Syntax and Axioms for Quantitative Regular Behaviours. - Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (CONCUR, 2009)

Minimization Algorithm for Symbolic Bisimilarity. - Filippo Bonchi; Ugo Montanari (ESOP, 2009)

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

On Barbs and Labels in Reactive Systems - Filippo Bonchi; Fabio Gadducci; Giacoma Valentina Monreale (SOS, 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)

Reactive systems, (semi-)saturated semantics and coalgebras on presheaves. - Filippo Bonchi; Ugo Montanari (Theor. Comput. Sci., 2009)

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

Generalizing the powerset construction, coalgebraically. - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (FSTTCS, 2010)

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

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

Deriving Labels and Bisimilarity for Concurrent Constraint Programming. - Andrés Aristizábal; Filippo Bonchi; Catuscia Palamidessi; Luis Fernando Pino; Frank D. Valencia (FoSSaCS, 2011)

Symbolic and Asynchronous Semantics via Normalized Coalgebras - Filippo Bonchi; Ugo Montanari (Log. Methods Comput. Sci., 2011)

Quantitative Kleene coalgebras. - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (Inf. Comput., 2011)

A lattice-theoretical perspective on adhesive categories. - Paolo Baldan; Filippo Bonchi; Andrea Corradini 001; Tobias Heindel; Barbara König 001 (J. Symb. Comput., 2011)

Brzozowski's Algorithm (Co)Algebraically. - Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten; Alexandra Silva 001 (Logic and Program Semantics, 2012)

A Coalgebraic Perspective on Minimization and Determinization. - Jirí Adámek; Filippo Bonchi; Mathias Hülsbusch; Barbara König 001; Stefan Milius; Alexandra Silva 001 (FoSSaCS, 2012)

Partition refinement for bisimilarity in CCP. - Andrés Aristizábal; Filippo Bonchi; Frank D. Valencia; Luis Fernando Pino (SAC, 2012)

Reducing Weak to Strong Bisimilarity in CCP - Andrés Aristizábal; Filippo Bonchi; Luis Fernando Pino; Frank Valencia (ICE, 2012)

Final Semantics for Decorated Traces. - Filippo Bonchi; Marcello M. Bonsangue; Georgiana Caltais; Jan J. M. M. Rutten; Alexandra Silva 001 (MFPS, 2012)

A coalgebraic perspective on linear weighted automata. - Filippo Bonchi; Marcello M. Bonsangue; Michele Boreale; Jan J. M. M. Rutten; Alexandra Silva 001 (Inf. Comput., 2012)

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

Preface to special issue: EXPRESS, ICE and SOS 2009. - Filippo Bonchi; Sibylle B. Fröschle; Daniele Gorla; Bartek Klin (Math. Struct. Comput. Sci., 2012)

Brzozowski's and Up-To Algorithms for Must Testing. - Filippo Bonchi; Georgiana Caltais; Damien Pous; Alexandra Silva 001 (APLAS, 2013)

Saturated Semantics for Coalgebraic Logic Programming. - Filippo Bonchi; Fabio Zanasi (CALCO, 2013)

Checking NFA equivalence with bisimulations up to congruence. - Filippo Bonchi; Damien Pous (POPL, 2013)

Efficient computation of program equivalence for confluent concurrent constraint programming. - Luis Fernando Pino; Filippo Bonchi; Frank D. Valencia (PPDP, 2013)

Generalizing determinization from automata to coalgebras - Alexandra Silva 001; Filippo Bonchi; Marcello M. Bonsangue; Jan J. M. M. Rutten (Log. Methods Comput. Sci., 2013)

How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. - Filippo Bonchi; Stefan Milius; Alexandra Silva 001; Fabio Zanasi (CMCS, 2014)

A Categorical Semantics of Signal Flow Graphs. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (CONCUR, 2014)

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

Coinduction up-to in a fibrational setting. - Filippo Bonchi; Daniela Petrisan; Damien Pous; Jurriaan Rot (CSL-LICS, 2014)

Interacting Bialgebras Are Frobenius. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (FoSSaCS, 2014)

Behavioral Metrics via Functor Lifting. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (FSTTCS, 2014)

A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice. - Luis Fernando Pino; Filippo Bonchi; Frank D. Valencia (ICTAC, 2014)

Interacting Hopf Algebras. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (CoRR, 2014)

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

Algebra-coalgebra duality in Brzozowski's minimization algorithm. - Filippo Bonchi; Marcello M. Bonsangue; Helle Hvid Hansen; Prakash Panangaden; Jan J. M. M. Rutten; Alexandra Silva 001 (ACM Trans. Comput. Log., 2014)

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

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

Towards Trace Metrics via Functor Lifting. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (CALCO, 2015)

Lax Bialgebras and Up-To Techniques for Weak Bisimulations. - Filippo Bonchi; Daniela Petrisan; Damien Pous; Jurriaan Rot (CONCUR, 2015)

Full Abstraction for Signal Flow Graphs. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (POPL, 2015)

Hacking nondeterminism with induction and coinduction. - Filippo Bonchi; Damien Pous (Commun. ACM, 2015)

Bialgebraic Semantics for Logic Programming. - Filippo Bonchi; Fabio Zanasi (Log. Methods Comput. Sci., 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)

Efficient algorithms for program equivalence for confluent concurrent constraint programming. - Luis Fernando Pino; Filippo Bonchi; Frank D. Valencia (Sci. Comput. Program., 2015)

Weak CCP bisimilarity with strong procedures. - Luis Fernando Pino; Andrés A. Aristizábal P.; Filippo Bonchi; Frank D. Valencia (Sci. Comput. Program., 2015)

Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure. - Filippo Bonchi; Stefan Milius; Alexandra Silva 001; Fabio Zanasi (Theor. Comput. Sci., 2015)

Lawvere Categories as Composed PROPs. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (CMCS, 2016)

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

Behaviour-Aware Matching of Cloud Applications. - Filippo Bonchi; Antonio Brogi; Andrea Canciani; Jacopo Soldani (TASE, 2016)

A coalgebraic view on decorated traces. - Filippo Bonchi; Marcello M. Bonsangue; Georgiana Caltais; Jan Rutten; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2016)

The Power of Convex Algebras. - Filippo Bonchi; Alexandra Silva 001; Ana Sokolova (CONCUR, 2017)

Refinement for Signal Flow Graphs. - Filippo Bonchi; Joshua Holland; Dusko Pavlovic; Pawel Sobocinski 001 (CONCUR, 2017)

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

Bisimilarity of Open Terms in Stream GSOS. - Filippo Bonchi; Matias David Lee; Jurriaan Rot (FSEN, 2017)

Up-To Techniques for Weighted Systems. - Filippo Bonchi; Barbara König 001; Sebastian Küpper (TACAS (1), 2017)

A general account of coinduction up-to. - Filippo Bonchi; Daniela Petrisan; Damien Pous; Jurriaan Rot (Acta Informatica, 2017)

Up-To Techniques for Weighted Systems (Extended Version). - Filippo Bonchi; Barbara König 001; Sebastian Küpper (CoRR, 2017)

Functorial Semantics for Relational Theories. - Filippo Bonchi; Dusko Pavlovic; Pawel Sobocinski 001 (CoRR, 2017)

The Calculus of Signal Flow Diagrams I: Linear relations on streams. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (Inf. Comput., 2017)

Enhanced coalgebraic bisimulation. - Jurriaan Rot; Filippo Bonchi; Marcello M. Bonsangue; Damien Pous; Jan Rutten; Alexandra Silva 001 (Math. Struct. Comput. Sci., 2017)

Graphical Conjunctive Queries. - Filippo Bonchi; Jens Seeber; Pawel Sobocinski 001 (CSL, 2018)

Sound up-to techniques and Complete abstract domains. - Filippo Bonchi; Pierre Ganty; Roberto Giacobazzi; Dusko Pavlovic (LICS, 2018)

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

Trace Semantics for Nondeterministic Probabilistic Automata via Determinization. - Filippo Bonchi; Ana Sokolova; Valeria Vignudelli (CoRR, 2018)

Deconstructing Lawvere with distributive laws. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (J. Log. Algebraic Methods Program., 2018)

Coalgebraic Behavioral Metrics. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (Log. Methods Comput. Sci., 2018)

Simulation-based matching of cloud applications. - Filippo Bonchi; Antonio Brogi; Andrea Canciani; Jacopo Soldani (Sci. Comput. Program., 2018)

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

The Axiom of Choice in Cartesian Bicategories. - Filippo Bonchi; Jens Seeber; Pawel Sobocinski 001 (CALCO, 2019)

Bialgebraic Semantics for String Diagrams. - Filippo Bonchi; Robin Piedeleu; Pawel Sobocinski 001; Fabio Zanasi (CONCUR, 2019)

Interacting Hopf Algebras: the Theory of Linear Systems (text not included). - Filippo Bonchi (ICTCS, 2019)

Graphical Affine Algebra. - Filippo Bonchi; Robin Piedeleu; Pawel Sobocinski 001; Fabio Zanasi (LICS, 2019)

The Theory of Traces for Systems with Nondeterminism and Probability. - Filippo Bonchi; Ana Sokolova; Valeria Vignudelli (LICS, 2019)

Diagrammatic algebra: from linear to concurrent systems. - Filippo Bonchi; Joshua Holland; Robin Piedeleu; Pawel Sobocinski 001; Fabio Zanasi (Proc. ACM Program. Lang., 2019)

Bisimilarity of open terms in stream GSOS. - Filippo Bonchi; Tom van Bussel; Matias David Lee; Jurriaan Rot (Sci. Comput. Program., 2019)

Contextual Equivalence for Signal Flow Graphs. - Filippo Bonchi; Robin Piedeleu; Pawel Sobocinski 001; Fabio Zanasi (FoSSaCS, 2020)

Cartesian bicategories with choice. - Filippo Bonchi; Jens Seeber; Pawel Sobocinski 001 (CoRR, 2020)

Presenting convex sets of probability distributions by convex semilattices and unique bases. - Filippo Bonchi; Ana Sokolova; Valeria Vignudelli (CoRR, 2020)

From Farkas' Lemma to Linear Programming: an Exercise in Diagrammatic Algebra ((Co)algebraic pearls). - Filippo Bonchi; Alessandro Di Giorgio 002; Fabio Zanasi (CALCO, 2021)

On Doctrines and Cartesian Bicategories. - Filippo Bonchi; Alessio Santamaria; Jens Seeber; Pawel Sobocinski 001 (CALCO, 2021)

Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases ((Co)algebraic pearls). - Filippo Bonchi; Ana Sokolova; Valeria Vignudelli (CALCO, 2021)

Combining Semilattices and Semimodules. - Filippo Bonchi; Alessio Santamaria (FoSSaCS, 2021)

Diagrammatic Polyhedral Algebra. - Filippo Bonchi; Alessandro Di Giorgio 002; Pawel Sobocinski 001 (FSTTCS, 2021)

Diagrammatic Polyhedral Algebra. - Guillaume Boisseau; Filippo Bonchi; Alessandro Di Giorgio 002; Pawel Sobocinski 001 (CoRR, 2021)

Bialgebraic foundations for the operational semantics of string diagrams. - Filippo Bonchi; Robin Piedeleu; Pawel Sobocinski 001; Fabio Zanasi (Inf. Comput., 2021)

Distribution Bisimilarity via the Power of Convex Algebras. - Filippo Bonchi; Alexandra Silva 001; Ana Sokolova (Log. Methods Comput. Sci., 2021)

A Survey of Compositional Signal Flow Theory. - Filippo Bonchi; Pawel Sobocinski 001; Fabio Zanasi (IFIP's Exciting First 60+ Years, 2021)

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

Convexity via Weak Distributive Laws. - Filippo Bonchi; Alessio Santamaria (Log. Methods Comput. Sci., 2022)

The Theory of Traces for Systems with Nondeterminism, Probability, and Termination. - Filippo Bonchi; Ana Sokolova; Valeria Vignudelli (Log. Methods 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)

Exploiting Adjoints in Property Directed Reachability Analysis. - Mayuko Kori; Flavio Ascari; Filippo Bonchi; Roberto Bruni 001; Roberta Gori; Ichiro Hasuo (CAV (2), 2023)

Up-to techniques for behavioural metrics via fibrations. - Filippo Bonchi; Barbara König 001; Daniela Petrisan (Math. Struct. Comput. Sci., 2023)

Deconstructing the Calculus of Relations with Tape Diagrams. - Filippo Bonchi; Alessandro Di Giorgio 002; Alessio Santamaria (Proc. ACM Program. Lang., 2023)

Diagrammatic Algebra of First Order Logic. - Filippo Bonchi; Alessandro Di Giorgio 002; Nathan Haydon; Pawel Sobocinski 001 (LICS, 2024)

When Lawvere Meets Peirce: An Equational Presentation of Boolean Hyperdoctrines. - Filippo Bonchi; Alessandro Di Giorgio 002; Davide Trotta (MFCS, 2024)

Effectful Mealy Machines: Bisimulation and Trace. - Filippo Bonchi; Elena Di Lavore; Mario Román (CoRR, 2024)

Tape Diagrams for Monoidal Monads. - Filippo Bonchi; Cipriano Junior Cioffo; Alessandro Di Giorgio 002; Elena Di Lavore (CALCO, 2025)

Effectful Mealy Machines: Coalgebraic and Causal Traces (Invited Talk). - Filippo Bonchi; Elena Di Lavore; Mario Román (CALCO, 2025)

Strong Induction Is an Up-To Technique. - Filippo Bonchi; Elena Di Lavore; Anna Ricci (CSL, 2025)

A Diagrammatic Algebra for Program Logics. - Filippo Bonchi; Alessandro Di Giorgio 002; Elena Di Lavore (FoSSaCS, 2025)

Mathematical Foundation of Interpretable Equivariant Surrogate Models. - Jacopo Joy Colombini; Filippo Bonchi; Francesco Giannini; Fosca Giannotti; Roberto Pellungrini; Patrizio Frosini (CoRR, 2025)

The calculus of neo-Peircean relations. - Filippo Bonchi; Alessandro Di Giorgio 002; Nathan Haydon; Pawel Sobocinski 001 (CoRR, 2025)

Program Logics via Distributive Monoidal Categories. - Filippo Bonchi; Elena Di Lavore; Mario Román; Sam Staton (CoRR, 2025)