Pawel Sobocinski

According to our database1, Pawel Sobocinski authored at least 79 papers between 2002 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Functorial semantics for partial theories.
Proc. ACM Program. Lang., 2021

Compositional Modelling of Network Games.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
Rule Algebras for Adhesive Categories.
Log. Methods Comput. Sci., 2020

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure.
CoRR, 2020

A canonical algebra of open transition systems.
CoRR, 2020

Games on graphs: a compositional approach.
CoRR, 2020

Cartesian bicategories with choice.
CoRR, 2020

Calculational Proofs in Relational Graphical Linear Algebra.
Proceedings of the Formal Methods: Foundations and Applications - 23rd Brazilian Symposium, 2020

Contextual Equivalence for Signal Flow Graphs.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Compositional Diagrammatic First-Order Logic.
Proceedings of the Diagrammatic Representation and Inference, 2020

2019
Diagrammatic algebra: from linear to concurrent systems.
Proc. ACM Program. Lang., 2019

Graphical Affine Algebra.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Bialgebraic Semantics for String Diagrams.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

CARTOGRAPHER: A Tool for String Diagrammatic Reasoning (Tool Paper).
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

The Axiom of Choice in Cartesian Bicategories.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Deconstructing Lawvere with distributive laws.
J. Log. Algebraic Methods Program., 2018

Rewriting with Frobenius.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Monoidal Multiplexing.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

Graphical Conjunctive Queries.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Report on LiCS 2016.
ACM SIGLOG News, 2017

The Calculus of Signal Flow Diagrams I: Linear relations on streams.
Inf. Comput., 2017

Functorial Semantics for Relational Theories.
CoRR, 2017

Confluence of Graph Rewriting with Interfaces.
Proceedings of the Programming Languages and Systems, 2017

Refinement for Signal Flow Graphs.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
A categorical approach to open and interconnected dynamical systems.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Rewriting modulo symmetric monoidal structure.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Lawvere Categories as Composed PROPs.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

2015
Relational presheaves, change of base and weak simulation.
J. Comput. Syst. Sci., 2015

Towards Compositional Graph Theory.
Proceedings of the 31st Conference on the Mathematical Foundations of Programming Semantics, 2015

Compositional model checking of concurrent systems, with Petri nets.
Proceedings of the Eleventh International Workshop on Developments in Computational Models, 2015

Full Abstraction for Signal Flow Graphs.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

2014
Processes and unfoldings: concurrent computations in adhesive categories.
Math. Struct. Comput. Sci., 2014

Modelling Adaptive Networks: The Case of the Petrified Voters.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

Interacting Hopf Algebras.
CoRR, 2014

Compositional Reachability in Petri Nets.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Transformation and Refinement of Rigid Structures.
Proceedings of the Graph Transformation - 7th International Conference, 2014

Interacting Bialgebras Are Frobenius.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

A Categorical Semantics of Signal Flow Graphs.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

A Programming Language for Spatial Distribution of Net Systems.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Report on CALCO 2013.
Bull. EATCS, 2013

Decomposing Petri nets
CoRR, 2013

Reachability via Compositionality in Petri nets
CoRR, 2013

Connector algebras for C/E and P/T nets' interactions.
Log. Methods Comput. Sci., 2013

Penrose: Putting Compositionality to Work for Petri Net Reachability.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Nets, Relations and Linking Diagrams.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012
Relational Presheaves as Labelled Transition Systems.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

2011
Being Van Kampen is a universal property
Log. Methods Comput. Sci., 2011

Adhesivity Is Not Enough: Local Church-Rosser Revisited.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

WiCcA : LTS Generation Tool for Wire Calculus.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Deriving structural labelled transitions for mobile ambients.
Inf. Comput., 2010

Representations of Petri Net Interactions.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Foreword: Festschrift for Mogens Nielsen's 60th birthday.
Theor. Comput. Sci., 2009

Making the Unobservable, Unobservable.
Electron. Notes Theor. Comput. Sci., 2009

Deriving Labelled Transition Systems - A Structural Approach.
Bull. EATCS, 2009

A non-interleaving process calculus for multi-party synchronisation
Proceedings of the Proceedings 2nd Interaction and Concurrency Experience: Structured Interactions, 2009

Van Kampen Colimits as Bicolimits in Span.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

Unfolding Grammars in Adhesive Categories.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Subobject Transformation Systems.
Appl. Categorical Struct., 2008

Deconstructing behavioural theories of mobility.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
A Well-behaved LTS for the Pi-calculus: (Abstract).
Electron. Notes Theor. Comput. Sci., 2007

Semantic Barbs and Biorthogonality.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Quasitoposes, Quasiadhesive Categories and Artin Glueing.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
General Reversibility.
Proceedings of the 13th International Workshop on Expressiveness in Concurrency, 2006

Reversing graph transformations.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2006

Toposes Are Adhesive.
Proceedings of the Graph Transformations, Third International Conference, 2006

Processes for Adhesive Rewriting Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005
Locating reaction with 2-categories.
Theor. Comput. Sci., 2005

Adhesive and quasiadhesive categories.
RAIRO Theor. Informatics Appl., 2005

A Congruence for Petri Nets.
Electron. Notes Theor. Comput. Sci., 2005

Reactive Systems over Cospans.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Deriving Weak Bisimulation Congruences from Reduction Systems.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Labels from Reductions: Towards a General Theory.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Process Congruences from Reaction Rules (Column: Concurrency).
Bull. EATCS, 2004

Adhesive Categories.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

Summary 1: Adhesivity, Bigraphs and Bisimulation Congruences.
Proceedings of the Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004

2003
Deriving Bisimulation Congruences using 2-categories.
Nord. J. Comput., 2003

Deriving Bisimulation Congruences: 2-Categories Vs Precategories.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

Syntactic Formats for Free.
Proceedings of the CONCUR 2003, 2003

2002
Deriving Bisimulation Congruences: A 2-categorical Approach.
Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002


  Loading...