Deriving Bisimulation Congruences: A 2-categorical Approach. - Vladimiro Sassone; Pawel Sobocinski 001 (EXPRESS, 2002)

Syntactic Formats for Free. - Bartek Klin; Pawel Sobocinski 001 (CONCUR, 2003)

Deriving Bisimulation Congruences: 2-Categories Vs Precategories. - Vladimiro Sassone; Pawel Sobocinski 001 (FoSSaCS, 2003)

Deriving Bisimulation Congruences using 2-categories. - Vladimiro Sassone; Pawel Sobocinski 001 (Nord. J. Comput., 2003)

Summary 1: Adhesivity, Bigraphs and Bisimulation Congruences. - Pawel Sobocinski 001 (Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004)

Adhesive Categories. - Stephen Lack; Pawel Sobocinski 001 (FoSSaCS, 2004)

Process Congruences from Reaction Rules (Column: Concurrency). - Pawel Sobocinski 001 (Bull. EATCS, 2004)

A Congruence for Petri Nets. - Vladimiro Sassone; Pawel Sobocinski 001 (PNGT@ICGT, 2004)

Labels from Reductions: Towards a General Theory. - Bartek Klin; Vladimiro Sassone; Pawel Sobocinski 001 (CALCO, 2005)

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

Reactive Systems over Cospans. - Vladimiro Sassone; Pawel Sobocinski 001 (LICS, 2005)

Adhesive and quasiadhesive categories. - Stephen Lack; Pawel Sobocinski 001 (RAIRO Theor. Informatics Appl., 2005)

Locating reaction with 2-categories. - Vladimiro Sassone; Pawel Sobocinski 001 (Theor. Comput. Sci., 2005)

Processes for Adhesive Rewriting Systems. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (FoSSaCS, 2006)

Toposes Are Adhesive. - Stephen Lack; Pawel Sobocinski 001 (ICGT, 2006)

Reversing graph transformations. - Pawel Sobocinski 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2006)

General Reversibility. - Vincent Danos; Jean Krivine; Pawel Sobocinski 001 (EXPRESS, 2006)

Quasitoposes, Quasiadhesive Categories and Artin Glueing. - Peter T. Johnstone; Stephen Lack; Pawel Sobocinski 001 (CALCO, 2007)

Semantic Barbs and Biorthogonality. - Julian Rathke; Vladimiro Sassone; Pawel Sobocinski 001 (FoSSaCS, 2007)

A Well-behaved LTS for the Pi-calculus: (Abstract). - Pawel Sobocinski 001 (SOS@LICS/ICALP, 2007)

Deconstructing behavioural theories of mobility. - Julian Rathke; Pawel Sobocinski 001 (IFIP TCS, 2008)

Subobject Transformation Systems. - Andrea Corradini 001; Frank Hermann 001; Pawel Sobocinski 001 (Appl. Categorical Struct., 2008)

Making the Unobservable, Unobservable. - Julian Rathke; Pawel Sobocinski 001 (ICE@ICALP, 2008)

Unfolding Grammars in Adhesive Categories. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (CALCO, 2009)

Van Kampen Colimits as Bicolimits in Span. - Tobias Heindel; Pawel Sobocinski 001 (CALCO, 2009)

A non-interleaving process calculus for multi-party synchronisation - Pawel Sobocinski 001 (ICE, 2009)

Deriving Labelled Transition Systems - A Structural Approach. - Julian Rathke; Pawel Sobocinski 001 (Bull. EATCS, 2009)

Foreword: Festschrift for Mogens Nielsen's 60th birthday. - Marco Carbone; Pawel Sobocinski 001; Frank D. Valencia (Theor. Comput. Sci., 2009)

Representations of Petri Net Interactions. - Pawel Sobocinski 001 (CONCUR, 2010)

Deriving structural labelled transitions for mobile ambients. - Julian Rathke; Pawel Sobocinski 001 (Inf. Comput., 2010)

WiCcA : LTS Generation Tool for Wire Calculus. - Jennifer Lantair; Pawel Sobocinski 001 (CALCO, 2011)

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

Being Van Kampen is a universal property - Tobias Heindel; Pawel Sobocinski 001 (Log. Methods Comput. Sci., 2011)

Relational Presheaves as Labelled Transition Systems. - Pawel Sobocinski 001 (CMCS, 2012)

Nets, Relations and Linking Diagrams. - Pawel Sobocinski 001 (CALCO, 2013)

Penrose: Putting Compositionality to Work for Petri Net Reachability. - Pawel Sobocinski 001; Owen Stephens (CALCO, 2013)

Connector algebras for C/E and P/T nets' interactions. - Roberto Bruni 001; Hernán C. Melgratti; Ugo Montanari; Pawel Sobocinski 001 (Log. Methods Comput. Sci., 2013)

Reachability via Compositionality in Petri nets - Pawel Sobocinski 001; Owen Stephens (CoRR, 2013)

Decomposing Petri nets - Julian Rathke; Pawel Sobocinski 001; Owen Stephens (CoRR, 2013)

Report on CALCO 2013. - Alexandra Silva 001; Pawel Sobocinski 001 (Bull. EATCS, 2013)

A Programming Language for Spatial Distribution of Net Systems. - Pawel Sobocinski 001; Owen Stephens (Petri Nets, 2014)

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

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

Transformation and Refinement of Rigid Structures. - Vincent Danos; Reiko Heckel; Pawel Sobocinski 001 (ICGT, 2014)

Compositional Reachability in Petri Nets. - Julian Rathke; Pawel Sobocinski 001; Owen Stephens (RP, 2014)

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

Modelling Adaptive Networks: The Case of the Petrified Voters. - Mudhafar Hussein; Reiko Heckel; Vincent Danos; Pawel Sobocinski 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014)

Processes and unfoldings: concurrent computations in adhesive categories. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (Math. Struct. Comput. Sci., 2014)

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

Compositional model checking of concurrent systems, with Petri nets. - Pawel Sobocinski 001 (DCM, 2015)

Towards Compositional Graph Theory. - Apiwat Chantawibul; Pawel Sobocinski 001 (MFPS, 2015)

Relational presheaves, change of base and weak simulation. - Pawel Sobocinski 001 (J. Comput. Syst. 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)

A categorical approach to open and interconnected dynamical systems. - Brendan Fong; Pawel Sobocinski 001; Paolo Rapisarda (LICS, 2016)

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)

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)

Report on LiCS 2016. - Pawel Sobocinski 001 (ACM SIGLOG News, 2017)

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

Monoidal Multiplexing. - Apiwat Chantawibul; Pawel Sobocinski 001 (ICTAC, 2018)

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

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

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

CARTOGRAPHER: A Tool for String Diagrammatic Reasoning (Tool Paper). - Pawel Sobocinski 001; Paul W. Wilson 002; Fabio Zanasi (CALCO, 2019)

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

Graphical Affine Algebra. - Filippo Bonchi; Robin Piedeleu; Pawel Sobocinski 001; Fabio Zanasi (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)

Compositional Diagrammatic First-Order Logic. - Nathan Haydon; Pawel Sobocinski 001 (Diagrams, 2020)

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

Calculational Proofs in Relational Graphical Linear Algebra. - João Paixão; Pawel Sobocinski 001 (SBMF, 2020)

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

Games on graphs: a compositional approach. - Elena Di Lavore; Jules Hedges; Pawel Sobocinski 001 (CoRR, 2020)

Rule Algebras for Adhesive Categories. - Nicolas Behr; Pawel Sobocinski 001 (Log. Methods Comput. Sci., 2020)

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

Compositional Modelling of Network Games. - Elena Di Lavore; Jules Hedges; Pawel Sobocinski 001 (CSL, 2021)

A Canonical Algebra of Open Transition Systems. - Elena Di Lavore; Alessandro Gianola; Mario Román; Nicoletta Sabadini; Pawel Sobocinski 001 (FACS, 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)

String Diagrammatic Electrical Circuit Theory. - Guillaume Boisseau; Pawel Sobocinski 001 (ACT, 2021)

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

Functorial semantics for partial theories. - Ivan Di Liberti; Fosco Loregiàn; Chad Nester; Pawel Sobocinski 001 (Proc. ACM Program. Lang., 2021)

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

Regular Monoidal Languages. - Matthew Earnshaw; Pawel Sobocinski 001 (MFCS, 2022)

Monoidal Width: Capturing Rank Width. - Elena Di Lavore; Pawel Sobocinski 001 (ACT, 2022)

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

High-level axioms for graphical linear algebra. - João Paixão; Lucas Rufino; Pawel Sobocinski 001 (Sci. Comput. Program., 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)

String Diagrammatic Trace Theory. - Matthew Earnshaw; Pawel Sobocinski 001 (MFCS, 2023)

Monoidal Width. - Elena Di Lavore; Pawel Sobocinski 001 (Log. Methods Comput. Sci., 2023)

Span(Graph): a canonical feedback algebra of open transition systems. - Elena Di Lavore; Alessandro Gianola; Mario Román; Nicoletta Sabadini; Pawel Sobocinski 001 (Softw. Syst. Model., 2023)

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

Regular planar monoidal languages. - Matthew Earnshaw; Pawel Sobocinski 001 (J. Log. Algebraic Methods Program., 2024)

Report on LiCS 2024. - Pawel Sobocinski 001 (ACM SIGLOG News, 2024)

String Diagrams for Premonoidal Categories. - Mario Román; Pawel Sobocinski 001 (Log. Methods Comput. Sci., 2025)

Partial Markov Categories. - Elena Di Lavore; Mario Román; Pawel Sobocinski 001 (CoRR, 2025)

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

Order in Partial Markov Categories. - Elena Di Lavore; Mario Román; Pawel Sobocinski 001; Márk Széles (CoRR, 2025)