Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Sobocinski 0001
Paweł Sobociński
Person information
- unicode name: Paweł Sobociński
- affiliation: Tallinn University of Technology, Estonia
- affiliation (former): University of Southampton, School of Electronics and Computer Science, UK
- affiliation (former): University of Cambridge, Computer Laboratory, UK
- affiliation (former): University of Aarhus, BRICS, Denmark
Other persons with the same name
- Pawel Sobocinski 0002
![[0000-0002-0529-252X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-0529-252X")
— Poznań University of Economics and Business, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i27]Filippo Bonchi, Alessandro Di Giorgio, Nathan Haydon, Pawel Sobocinski:
Diagrammatic Algebra of First Order Logic. CoRR abs/2401.07055 (2024)- 2023
- [j28]Elena Di Lavore, Pawel Sobocinski:
Monoidal Width. Log. Methods Comput. Sci. 19(3) (2023) - [j27]Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini, Pawel Sobocinski:
Span(Graph): a canonical feedback algebra of open transition systems. Softw. Syst. Model. 22(2): 495-520 (2023) - [c57]Matthew Earnshaw, Pawel Sobocinski:
String Diagrammatic Trace Theory. MFCS 2023: 43:1-43:15 - [e5]Orna Kupferman, Pawel Sobocinski:
Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings. Lecture Notes in Computer Science 13992, Springer 2023, ISBN 978-3-031-30828-4 [contents] - [i26]Matthew Earnshaw, Pawel Sobocinski:
String Diagrammatic Trace Theory. CoRR abs/2306.16341 (2023) - 2022
- [j26]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure. J. ACM 69(2): 14:1-14:58 (2022) - [j25]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String diagram rewrite theory II: Rewriting with symmetric monoidal structure. Math. Struct. Comput. Sci. 32(4): 511-541 (2022) - [j24]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String diagram rewrite theory III: Confluence with and without Frobenius. Math. Struct. Comput. Sci. 32(7): 829-869 (2022) - [j23]João Paixão, Lucas Rufino, Pawel Sobocinski:
High-level axioms for graphical linear algebra. Sci. Comput. Program. 218: 102791 (2022) - [c56]Matthew Earnshaw, Pawel Sobocinski:
Regular Monoidal Languages. MFCS 2022: 44:1-44:14 - [c55]Elena Di Lavore, Pawel Sobocinski:
Monoidal Width: Capturing Rank Width. ACT 2022: 268-283 - [i25]Elena Di Lavore, Pawel Sobocinski:
Monoidal Width. CoRR abs/2202.07582 (2022) - [i24]Matthew Earnshaw, Pawel Sobocinski:
Regular Monoidal Languages. CoRR abs/2207.00526 (2022) - [i23]Elena Di Lavore, Pawel Sobocinski:
Monoidal Width. CoRR abs/2212.13229 (2022) - 2021
- [j22]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Bialgebraic foundations for the operational semantics of string diagrams. Inf. Comput. 281: 104767 (2021) - [j21]Ivan Di Liberti, Fosco Loregiàn, Chad Nester, Pawel Sobocinski:
Functorial semantics for partial theories. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [c54]Filippo Bonchi, Alessio Santamaria, Jens Seeber, Pawel Sobocinski:
On Doctrines and Cartesian Bicategories. CALCO 2021: 10:1-10:17 - [c53]Elena Di Lavore, Jules Hedges, Pawel Sobocinski:
Compositional Modelling of Network Games. CSL 2021: 30:1-30:24 - [c52]Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini, Pawel Sobocinski:
A Canonical Algebra of Open Transition Systems. FACS 2021: 63-81 - [c51]Filippo Bonchi, Alessandro Di Giorgio, Pawel Sobocinski:
Diagrammatic Polyhedral Algebra. FSTTCS 2021: 40:1-40:18 - [c50]Guillaume Boisseau, Pawel Sobocinski:
String Diagrammatic Electrical Circuit Theory. ACT 2021: 178-191 - [p1]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
A Survey of Compositional Signal Flow Theory. IFIP's Exciting First 60+ Years 2021: 29-56 - [i22]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure. CoRR abs/2104.14686 (2021) - [i21]Guillaume Boisseau, Filippo Bonchi, Alessandro Di Giorgio, Pawel Sobocinski:
Diagrammatic Polyhedral Algebra. CoRR abs/2105.10946 (2021) - [i20]Filippo Bonchi, Alessio Santamaria, Jens Seeber, Pawel Sobocinski:
On Doctrines and Cartesian Bicategories. CoRR abs/2106.08142 (2021) - [i19]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory III: Confluence with and without Frobenius. CoRR abs/2109.06049 (2021) - 2020
- [j20]Nicolas Behr, Pawel Sobocinski:
Rule Algebras for Adhesive Categories. Log. Methods Comput. Sci. 16(3) (2020) - [c49]Nathan Haydon, Pawel Sobocinski:
Compositional Diagrammatic First-Order Logic. Diagrams 2020: 402-418 - [c48]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Contextual Equivalence for Signal Flow Graphs. FoSSaCS 2020: 77-96 - [c47]João Paixão, Pawel Sobocinski:
Calculational Proofs in Relational Graphical Linear Algebra. SBMF 2020: 83-100 - [i18]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Contextual Equivalence for Signal Flow Graphs. CoRR abs/2002.08874 (2020) - [i17]Filippo Bonchi, Jens Seeber, Pawel Sobocinski:
Cartesian bicategories with choice. CoRR abs/2003.09453 (2020) - [i16]Elena Di Lavore, Jules Hedges, Pawel Sobocinski:
Games on graphs: a compositional approach. CoRR abs/2006.03493 (2020) - [i15]Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini, Pawel Sobocinski:
A canonical algebra of open transition systems. CoRR abs/2010.10069 (2020) - [i14]Ivan Di Liberti, Fosco Loregiàn, Chad Nester, Pawel Sobocinski:
Functorial Semantics for Partial Theories. CoRR abs/2011.06644 (2020) - [i13]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure. CoRR abs/2012.01847 (2020)
2010 – 2019
- 2019
- [j19]Filippo Bonchi, Joshua Holland, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Diagrammatic algebra: from linear to concurrent systems. Proc. ACM Program. Lang. 3(POPL): 25:1-25:28 (2019) - [c46]Filippo Bonchi, Jens Seeber, Pawel Sobocinski:
The Axiom of Choice in Cartesian Bicategories. CALCO 2019: 15:1-15:17 - [c45]Pawel Sobocinski, Paul W. Wilson, Fabio Zanasi:
CARTOGRAPHER: A Tool for String Diagrammatic Reasoning (Tool Paper). CALCO 2019: 20:1-20:7 - [c44]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Bialgebraic Semantics for String Diagrams. CONCUR 2019: 37:1-37:17 - [c43]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Graphical Affine Algebra. LICS 2019: 1-12 - [i12]Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Bialgebraic Semantics for String Diagrams. CoRR abs/1906.01519 (2019) - 2018
- [j18]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Deconstructing Lawvere with distributive laws. J. Log. Algebraic Methods Program. 95: 128-146 (2018) - [c42]Nicolas Behr, Pawel Sobocinski:
Rule Algebras for Adhesive Categories. CSL 2018: 11:1-11:21 - [c41]Filippo Bonchi, Jens Seeber, Pawel Sobocinski:
Graphical Conjunctive Queries. CSL 2018: 13:1-13:23 - [c40]Apiwat Chantawibul, Pawel Sobocinski:
Monoidal Multiplexing. ICTAC 2018: 116-131 - [c39]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting with Frobenius. LICS 2018: 165-174 - [i11]Filippo Bonchi, Jens Seeber, Pawel Sobocinski:
Graphical Conjunctive Queries. CoRR abs/1804.07626 (2018) - [i10]Nicolas Behr, Pawel Sobocinski:
Rule Algebras for Adhesive Categories. CoRR abs/1807.00785 (2018) - 2017
- [j17]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
The Calculus of Signal Flow Diagrams I: Linear relations on streams. Inf. Comput. 252: 2-29 (2017) - [j16]Pawel Sobocinski:
Report on LiCS 2016. ACM SIGLOG News 4(1): 38-39 (2017) - [c38]Filippo Bonchi, Joshua Holland, Dusko Pavlovic, Pawel Sobocinski:
Refinement for Signal Flow Graphs. CONCUR 2017: 24:1-24:16 - [c37]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Confluence of Graph Rewriting with Interfaces. ESOP 2017: 141-169 - [i9]Filippo Bonchi, Dusko Pavlovic, Pawel Sobocinski:
Functorial Semantics for Relational Theories. CoRR abs/1711.08699 (2017) - 2016
- [c36]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Lawvere Categories as Composed PROPs. CMCS 2016: 11-32 - [c35]Brendan Fong, Pawel Sobocinski, Paolo Rapisarda:
A categorical approach to open and interconnected dynamical systems. LICS 2016: 495-504 - [c34]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting modulo symmetric monoidal structure. LICS 2016: 710-719 - [i8]Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting modulo symmetric monoidal structure. CoRR abs/1602.06771 (2016) - 2015
- [j15]Pawel Sobocinski:
Relational presheaves, change of base and weak simulation. J. Comput. Syst. Sci. 81(5): 901-910 (2015) - [c33]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Full Abstraction for Signal Flow Graphs. POPL 2015: 515-526 - [c32]Pawel Sobocinski:
Compositional model checking of concurrent systems, with Petri nets. DCM 2015: 19-30 - [c31]Apiwat Chantawibul, Pawel Sobocinski:
Towards Compositional Graph Theory. MFPS 2015: 121-136 - [e4]Lawrence S. Moss, Pawel Sobocinski:
6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, June 24-26, 2015, Nijmegen, The Netherlands. LIPIcs 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-84-2 [contents] - [i7]Brendan Fong, Paolo Rapisarda, Pawel Sobocinski:
A categorical approach to open and interconnected dynamical systems. CoRR abs/1510.05076 (2015) - 2014
- [j14]Mudhafar Hussein, Reiko Heckel, Vincent Danos, Pawel Sobocinski:
Modelling Adaptive Networks: The Case of the Petrified Voters. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 67 (2014) - [j13]Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski:
Processes and unfoldings: concurrent computations in adhesive categories. Math. Struct. Comput. Sci. 24(4) (2014) - [c30]Pawel Sobocinski, Owen Stephens:
A Programming Language for Spatial Distribution of Net Systems. Petri Nets 2014: 150-169 - [c29]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
A Categorical Semantics of Signal Flow Graphs. CONCUR 2014: 435-450 - [c28]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Interacting Bialgebras Are Frobenius. FoSSaCS 2014: 351-365 - [c27]Vincent Danos, Reiko Heckel, Pawel Sobocinski:
Transformation and Refinement of Rigid Structures. ICGT 2014: 146-160 - [c26]Julian Rathke, Pawel Sobocinski, Owen Stephens:
Compositional Reachability in Petri Nets. RP 2014: 230-243 - [i6]Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi:
Interacting Hopf Algebras. CoRR abs/1403.7048 (2014) - 2013
- [j12]Roberto Bruni, Hernán C. Melgratti, Ugo Montanari, Pawel Sobocinski:
Connector algebras for C/E and P/T nets' interactions. Log. Methods Comput. Sci. 9(3) (2013) - [j11]Alexandra Silva, Pawel Sobocinski:
Report on CALCO 2013. Bull. EATCS 111 (2013) - [c25]Pawel Sobocinski:
Nets, Relations and Linking Diagrams. CALCO 2013: 282-298 - [c24]Pawel Sobocinski, Owen Stephens:
Penrose: Putting Compositionality to Work for Petri Net Reachability. CALCO 2013: 346-352 - [i5]Pawel Sobocinski, Owen Stephens:
Reachability via Compositionality in Petri nets. CoRR abs/1303.1399 (2013) - [i4]Pawel Sobocinski:
Nets, relations and linking diagrams. CoRR abs/1303.3371 (2013) - [i3]Julian Rathke, Pawel Sobocinski, Owen Stephens:
Decomposing Petri nets. CoRR abs/1304.3121 (2013) - 2012
- [c23]Pawel Sobocinski:
Relational Presheaves as Labelled Transition Systems. CMCS 2012: 40-50 - 2011
- [j10]Tobias Heindel, Pawel Sobocinski:
Being Van Kampen is a universal property. Log. Methods Comput. Sci. 7(1) (2011) - [c22]Jennifer Lantair, Pawel Sobocinski:
WiCcA : LTS Generation Tool for Wire Calculus. CALCO 2011: 407-412 - [c21]Paolo Baldan, Fabio Gadducci, Pawel Sobocinski:
Adhesivity Is Not Enough: Local Church-Rosser Revisited. MFCS 2011: 48-59 - [e3]Michel A. Reniers, Pawel Sobocinski:
Proceedings Eight Workshop on Structural Operational Semantics 2011, SOS 2011, Aachen, Germany, 5th September 2011. EPTCS 62, 2011 [contents] - 2010
- [j9]Julian Rathke, Pawel Sobocinski:
Deriving structural labelled transitions for mobile ambients. Inf. Comput. 208(10): 1221-1242 (2010) - [c20]Pawel Sobocinski:
Representations of Petri Net Interactions. CONCUR 2010: 554-568 - [e2]Luca Aceto, Pawel Sobocinski:
Proceedings Seventh Workshop on Structural Operational Semantics, SOS 2010, Paris, France, 30 August 2010. EPTCS 32, 2010 [contents]
2000 – 2009
- 2009
- [j8]Julian Rathke, Pawel Sobocinski:
Deriving Labelled Transition Systems - A Structural Approach. Bull. EATCS 98: 108-122 (2009) - [j7]Marco Carbone, Pawel Sobocinski, Frank D. Valencia:
Foreword: Festschrift for Mogens Nielsen's 60th birthday. Theor. Comput. Sci. 410(41): 4001-4005 (2009) - [c19]Tobias Heindel, Pawel Sobocinski:
Van Kampen Colimits as Bicolimits in Span. CALCO 2009: 335-349 - [c18]Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski:
Unfolding Grammars in Adhesive Categories. CALCO 2009: 350-366 - [e1]Bartek Klin, Pawel Sobocinski:
Proceedings Sixth Workshop on Structural Operational Semantics, SOS 2009, Bologna, Italy, August 31, 2009. EPTCS 18, 2009 [contents] - [i2]Pawel Sobocinski:
A non-interleaving process calculus for multi-party synchronisation. ICE 2009: 87-98 - 2008
- [j6]Andrea Corradini, Frank Hermann, Pawel Sobocinski:
Subobject Transformation Systems. Appl. Categorical Struct. 16(3): 389-419 (2008) - [c17]Julian Rathke, Pawel Sobocinski:
Deriving Structural Labelled Transitions for Mobile Ambients. CONCUR 2008: 462-476 - [c16]Julian Rathke, Pawel Sobocinski:
Deconstructing behavioural theories of mobility. IFIP TCS 2008: 507-520 - [c15]Julian Rathke, Pawel Sobocinski:
Making the Unobservable, Unobservable. ICE@ICALP 2008: 131-144 - 2007
- [c14]Peter T. Johnstone, Stephen Lack, Pawel Sobocinski:
Quasitoposes, Quasiadhesive Categories and Artin Glueing. CALCO 2007: 312-326 - [c13]Julian Rathke, Vladimiro Sassone, Pawel Sobocinski:
Semantic Barbs and Biorthogonality. FoSSaCS 2007: 302-316 - [c12]Pawel Sobocinski:
A Well-behaved LTS for the Pi-calculus: (Abstract). SOS@LICS/ICALP 2007: 5-11 - 2006
- [j5]Pawel Sobocinski:
Reversing graph transformations. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 2 (2006) - [c11]Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski:
Processes for Adhesive Rewriting Systems. FoSSaCS 2006: 202-216 - [c10]Stephen Lack, Pawel Sobocinski:
Toposes Are Adhesive. ICGT 2006: 184-198 - [c9]Vincent Danos, Jean Krivine, Pawel Sobocinski:
General Reversibility. EXPRESS 2006: 75-86 - 2005
- [j4]Stephen Lack, Pawel Sobocinski:
Adhesive and quasiadhesive categories. RAIRO Theor. Informatics Appl. 39(3): 511-545 (2005) - [j3]Vladimiro Sassone, Pawel Sobocinski:
Locating reaction with 2-categories. Theor. Comput. Sci. 333(1-2): 297-327 (2005) - [c8]Bartek Klin, Vladimiro Sassone, Pawel Sobocinski:
Labels from Reductions: Towards a General Theory. CALCO 2005: 30-50 - [c7]Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawel Sobocinski:
Deriving Weak Bisimulation Congruences from Reduction Systems. CONCUR 2005: 293-307 - [c6]Vladimiro Sassone, Pawel Sobocinski:
Reactive Systems over Cospans. LICS 2005: 311-320 - 2004
- [j2]Pawel Sobocinski:
Process Congruences from Reaction Rules (Column: Concurrency). Bull. EATCS 84: 102-127 (2004) - [c5]Stephen Lack, Pawel Sobocinski:
Adhesive Categories. FoSSaCS 2004: 273-288 - [c4]Vladimiro Sassone, Pawel Sobocinski:
A Congruence for Petri Nets. PNGT@ICGT 2004: 107-120 - [i1]Pawel Sobocinski:
Summary 1: Adhesivity, Bigraphs and Bisimulation Congruences. Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004 - 2003
- [j1]Vladimiro Sassone, Pawel Sobocinski:
Deriving Bisimulation Congruences using 2-categories. Nord. J. Comput. 10(2): 163- (2003) - [c3]Bartek Klin, Pawel Sobocinski:
Syntactic Formats for Free. CONCUR 2003: 72-86 - [c2]Vladimiro Sassone, Pawel Sobocinski:
Deriving Bisimulation Congruences: 2-Categories Vs Precategories. FoSSaCS 2003: 409-424 - 2002
- [c1]Vladimiro Sassone, Pawel Sobocinski:
Deriving Bisimulation Congruences: A 2-categorical Approach. EXPRESS 2002: 105-123
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-07 03:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
