See veebileht kasutab küpsiseid kasutaja sessiooni andmete hoidmiseks. Veebilehe kasutamisega nõustute ETISe kasutustingimustega. Loe rohkem
Olen nõus

Paweł Maria Sobociński

https://www.etis.ee/CV/Pawel_Sobocinski/est
3.04.1978
‭+372 5366 6882‬
pawel@cs.ioc.ee
http://cs.ioc.ee/~pawel
AAK-1370-2020
Scopus Author Id 8406504300

Google Scholar citations
https://scholar.google.com/citations?user=n1k-QJgAAAAJ

Teenistuskäik

Töökohad ja ametid
01.09.2019–...   
Tallinna Tehnikaülikool, Infotehnoloogia teaduskond, Tarkvarateaduse instituut, Täisprofessor tenuuris (1,00)
01.12.2017–01.09.2019   
University of Southampton, Dotsent (1,00)
01.03.2010–01.12.2017   
University of Southampton, Lektor (1,00)
01.03.2007–01.03.2010   
University of Southampton, Erakorraline lektor (1,00)
01.05.2005–01.03.2007   
University of Cambridge, Teadur (1,00)
01.12.2004–01.05.2005   
PPS, University of Paris VII, Järeldoktor (1,00)
01.07.2004–01.12.2004   
University of Pisa, Järeldoktor (1,00)
 
 
Haridustee
2000–2004   
doktoriõpingud arvutiteaduse, BRICS, Aarhusi Ülikool
1996–1999   
bakalaureuseõpingud arvutiteaduses ja -tehnoloogias, Sydney Ülikool
 
 
Teadusorganisatsiooniline ja -administratiivne tegevus
2021−...   
liige, Expert Panel on Computer Science and Informatics, National Science Centre NCN, Poola
2020−...   
kaasorganisaator, Online World Seminar on Logic and Semantics (OWLS)
2020−...   
IKT doktoriõppekava programmijuht, TTÜ
2020−...   
korraldustoimkonna esimees, MFCS 2021
2019−...   
tarkvarateaduse instituudi nõukogu liige, TTÜ
2018−...   
ajakirja kaastoimetaja, Compositionality
2016−...   
ajakirja kaastoimetaja, Mathematical Structures in Computer Science
2015−...   
liige, IFIP Working Group 2.2, Formal Description of Programming Concepts
2014−...   
liige, IFIP Working Group 1.3, Foundations of System Specification
2022−2022   
programmitoimkonna liige, 33rd International Conference on Concurrency Theory (CONCUR 2022)
2022−2022   
kaasesimees, 26th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2023)
2021−2021   
programmitoimkonna liige, 32nd International Conference on Concurrency Theory (CONCUR 2021)
2021−2021   
programmitoimkonna liige, 12th International Conference on the Theory and Application of Diagrams (Diagrams 2021)
2021−2022   
programmitoimkonna liige, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
2021−2022   
programmitoimkonna liige, 25th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2022)
2020−2020   
programmitoimkonna liige, 25th Annual ACM/IEEE Symposium on Logic in Computer Science (LiCS 2020)
2020−2020   
programmitoimkonna liige, 17th International Conference on Quantum and Physics Logic (QPL 2020)
2020−2020   
programmitoimkonna liige, 13th International Conference on Graph Transformation (ICGT 2020)
2020−2020   
programmitoimkonna liige, Semantic Spaces at the Intersection of NLP, Physics and Cognitive Science (SEMSPACE 2020)
2020−2020   
programmitoimkonna liige ja korraldaja, 7th Symposium on Compositional Structures (SYCO 7)
2020−2020   
programmitoimkonna liige, 3rd IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, Track B: Logic, Semantics, and Programming Theory (TTCS 2020)
2020−2020   
Chair, 4th Workshop on String Diagrams in Computation, Logic, and Physics (STRINGS 2020)
2019−2019   
programmitoimkonna liige, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Track B
2019−2019   
programmitoimkonna liige, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
2019−2019   
programmitoimkonna liige, 16th International Conference on Quantum and Physics Logic (QPL 2019)
2019−2019   
programmitoimkonna liige, 2nd Annual International Conference on Applied Category Theory (ACT 2019)
2019−2019   
programmitoimkonna liige, International Conference on Software Testing, Machine Learning and Complex Process Analysis (TMPA 2019)
2019−2019   
programmitoimkonna liige, Semantic Spaces at the Intersection of NLP, Physics and Cognitive Science 2019 (SEMSPACE 2019)
2019−2019   
programmitoimkonna esimees 3rd Workshop on String Diagrams in Computation, Logic and Physics (STRINGS 2019)
2019−2019   
programmitoimkonna liige, 6th Symposium on Compositional Structures (SYCO 6)
2018−2018   
programmitoimkonna liige, 15th International Conference on Quantum Physics and Logic (QPL 2018)
2018−2018   
programmitoimkonna liige, 29th Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2018)
2018−2018   
programmitoimkonna liige, 24th International Workshop on Algebraic Development Techniques (WADT 2018)
2018−2018   
programmitoimkonna liige, 4th Workshop on Higher Dimensional Rewriting and Aplications (HDRA 2018)
2018−2018   
programmitoimkonna liige, 1st Symposium on Compositional Structures (SYCO 1)
2018−2018   
programmitoimkonna liige, 2nd Symposium on Compositional Structures (SYCO 2)
2018−2018   
programmitoimkonna liige, Workshop on Compositional Approaches in Physics, NLP, and the Social Sciences
2018−2018   
Chair, NII Shonan meeting on Diagrammatic Methods for Linear and Nonlinear Systems
2017−2017   
prorgammitoimkonna liige, 14th Conference on Quantum Physics and Logic (QPL 2017)
2017−2017   
programmitoimkonna liige, 28th Conference on Concurrency Theory (CONCUR 2017)
2017−2017   
programmitoimkonna liige, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
2017−2017   
programmitoimkonna liige, 28th Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2017)
2017−2017   
programmitoimkonna liige, 4th International Conference on Tools and Methods of Program Analysis (TMPA 2017)
2017−2017   
programmitoimkonna liige, 1st Workshop on Recent Advances in Concurrency and Logic (RADICAL 2017)
2017−2017   
programmitoimkonna liige, 3rd Workshop on Higher-Dimensional Rewriting and Applications (HDRA 2017)
2017−2017   
Chair, 1st Workshop on String Diagrams in Computation, Logic, and Physics (STRINGS 2017)
2017−2017   
programmitoimkonna liige, Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics (EXPRESS/SOS 2017)
2017−2017   
programmitoimkonna liige, 3rd International Workshop on Meta Models for Process Languages (MeMo 2017)

Kvalifikatsioon

Teaduskraadid
Paweł Maria Sobociński, doktorikraad, 2004, (juh) Mogens Nielsen, Deriving process congruences from reaction rules (Protsessikongruentside tuletamine reaktsioonireeglitest), Aarhusi Ülikool.
 
 
Teaduspreemiad ja tunnustused
2021, Paweł Maria Sobociński, kutsutud tutorialist, XXXVII Mathematical Foundations of Programming Semantics (MFPS 21)
2019, Paweł Maria Sobociński, kutsutud kõneleja, 31st Nordic Workshop on Programming Theory, NWPT'19
2019, Paweł Maria Sobociński, kutsutud kõneleja, International Category Theory Conference 2019
2018, Paweł Maria Sobociński, kutsutud kõneleja, 2nd Workshop on Open Games
2018, Paweł Maria Sobociński, kutsutud lektor, Applied Category Theory Research School, Lorentz Center, Leiden, Netherlands
2017, Paweł Maria Sobociński, kutsutud tutorialist, 28th Int. Conference on Concurrency Theory (CONCUR 2017)
2017, Paweł Maria Sobociński, kutsutud kõneleja, Workshop on Compositional Methods for Network Diagrams and Component-Based Systems, Bellairs Institute
2017, Paweł Maria Sobociński, kutsutud kõneleja, Workshop on Hopf Algebras in Kitaev’s Quantum Double Models: Mathematical Connections from Gauge Theory to Topological Quantum Computing and Categorical Quantum Mechanics, Perimeter Intitute
2017, Paweł Maria Sobociński, kutsutud kõneleja, 10th Interaction and Concurrency Experience (ICE 2017)
2017, Paweł Maria Sobociński, kutsutud lektor, 2017 Midlands Graduate School (MGS 2017)
2017, Paweł Maria Sobociński, kutsutud lektor, 22nd Estonian Winter School in Computer Science (EWSCS 2017)
2017, Paweł Maria Sobociński, kutsutud lektor PhD-open, Open lectures for PhD students in computer science, University of Warsaw
2016, Paweł Maria Sobociński, kutsutud kõneleja, Workshop on Compositionality, Simons Institute
2016, Paweł Maria Sobociński, kutsutud kõneleja, 2nd Workshop on Higher-Dimensional Rewriting and Applications (HDRA 2016)
2015, Paweł Maria Sobociński, kutsutud kõneleja, 11th International Workshop on Developments in Computational Models (DCM 2015)
2015, Paweł Maria Sobociński, kutsutud tutorialist, 12th Int. Conference on Quantum Physics and Logic (QPL 2015)
 
 
Teadustöö põhisuunad
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.6. Arvutiteadused; CERCS KLASSIFIKAATOR: P170 Arvutiteadus, arvutusmeetodid, süsteemid, juhtimine (automaatjuhtimisteooria); TÄPSUSTUS: rakendluslik kategooriateooria
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.4. Matemaatika; CERCS KLASSIFIKAATOR: P110 Matemaatiline loogika, hulgateooria, kombinatoorika
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.4. Matemaatika; CERCS KLASSIFIKAATOR: P120 Arvuteooria, väljateooria, algebraline geomeetria, algebra, rühmateooria
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.6. Arvutiteadused; CERCS KLASSIFIKAATOR: P175 Informaatika, süsteemiteooria
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.6. Arvutiteadused; CERCS KLASSIFIKAATOR: P176 Tehisintellekt
 
 
Lisainfo

Jooksvad projektid

Juhendamisel väitekirjad

Juhendatud väitekirjad

Juhendatud järeldoktorid

  • 01.11.2019−30.06.2022 Edward Morehouse "arvutiteadus" Tallinna Tehnikaülikool
  • 01.01.2020−30.06.2022 Fosco Loregian "arvutiteadus" Tallinna Tehnikaülikool
  • 01.10.2020−30.09.2022 Amar Hadzihasanovic "arvutiteadus" Tallinna Tehnikaülikool

Publikatsioonid

Klass
Aasta
Publikatsioon
 
1.1.
2022
Paixão, João; Rufino, Lucas; Sobociński, Paweł (2022). High-level axioms for graphical linear algebra. Science of Computer Programming, 102791. DOI: 10.1016/j.scico.2022.102791.
1.1.
2022
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobocinski, Pawel; Zanasi, Fabio (2022). String diagram rewrite theory I: rewriting with Frobenius structure. Journal of the ACM, 69 (2), 1−58. DOI: 10.1145/3502719.
1.1.
2021
di Liberti, Ivan; Loregian, Fosco; Nester, Chad; Sobociński, Paweĺ (2021). Functorial semantics for partial theories. Proceedings of the ACM on Programming Languages, 5 (POPL), art. 57, 28 pp. DOI: 10.1145/3434338.
1.1.
2021
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Pawel; Zanasi, Fabio; (2021). Bialgebraic foundations for the operational semantics of string diagrams. Information and Computation, 104767. DOI: 10.1016/j.ic.2021.104767.
3.1.
2021
Di Lavore, Elena; Hedges, Jules; Sobociński, Paweł (2021). Compositional modelling of games on networks. 29th EACSL Annual Conference on Computer Science Logic (CSL 2021) : January 25-28, 2021, Ljubljana, Slovenia. Ed. Baier, Christel; Goubault-Larrecq, Jean. Saarbrücken/Wadern: Dagstuhl Publishing, 30:1−30:24. (Leibniz International Proceedings in Informatics; 183). DOI: 10.4230/LIPIcs.CSL.2021.30.
3.1.
2021
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2021). A survey of Compositional signal flow theory. Advancing Research in Information and Communication Technology : IFIP's Exciting First 60+ Years, Views from the Technical Committees and Working Groups. Ed. Goedicke, Michael; Neuhold, Erich; Rannenberg, Kai;. Cham: Springer, 29−56. (IFIP Advances in Information and Communication Technology; 600). DOI: 10.1007/978-3-030-81701-5_2.
3.1.
2021
Bonchi, Filippo; Santamaria, Alessio; Seeber, Jens; Sobociński, Paweł (2021). On doctrines and Cartesian bicategories. CALCO 2021 : 9th International Conference on Algebra and Coalgebra in Computer Science, Aug 31 - Sep 3, 2021, Salzburg, Austria.Proceedings. Ed. Gadducci, Fabio; Silva, Alexandra. Dagstuhl Publishing, 10:1−10:7. (LIPIcs–Leibniz International Proceedings in Informatics; 211). DOI: 10.4230/LIPIcs.CALCO.2021.10.
3.1.
2021
Boisseau,Guillaume; Sobocinski,Pawel (2021). String diagrammatic electrical circuit theory. Proceedings of the 4th Annual International Applied Category Theory Conference 2021 [ACT 2021] : Cambridge, USA, 12-16 July 2021. Open Publishing Association. (Electronic Proceedings in Theoretical Computer Science) [ilmumas].
3.1.
2021
Bonchi, Filippo; Di Giorgio, Alessandro; Sobociński, Paweł (2021). Diagrammatic polyhedral algebra. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. Ed. Bojańczyk, Mikołaj; Chekuri, Chandra. Saarbrücken/Wadern: Dagstuhl Publishing, 40:1−40:18. (LIPIcs–Leibniz International Proceedings in Informatics; 213). DOI: 10.4230/LIPIcs.FSTTCS.2021.40.
3.1.
2021
Di Lavore, Elena; Gianola, Alessandro; Roman, Mario; Sabadini, Nicoletta; Sobocinski, Pawel (2021). A canonical algebra of open transition systems. Formal Aspects Of Component Software (Facs 2021): 17th International Conference on Formal Aspects of Component Software (FACS), OCT 28-29, 2021, ELECTR NETWORK. Ed. Salaun, G.; Wijs, A. Cham: Springer, 63−81. (Lecture Notes in Computer Science; 13077). DOI: 10.1007/978-3-030-90636-8_4.
1.1.
2020
Behr, Nicolas; Soboćinski, Paweĺ (2020). Rule algebras for adhesive categories. Logical Methods in Computer Science, 16 (3), 2:1−2:38. DOI: 10.23638/lmcs-16(3:2)2020.
3.1.
2020
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio (2020). Contextual equivalence for signal flow graphs. Foundations of Software Science and Computation Structures : 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Ed. Goubault-Larrecq, Jean; König, Barbara. Cham: Springer, 77−96. (Lecture Notes in Computer Science; 12077). DOI: 10.1007/978-3-030-45231-5_5.
3.1.
2020
Haydon, Nathan; Sobociński, Paweł (2020). Compositional diagrammatic first-order logic. Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings. Ed. Pietarinen, Ahti-Veikko; Chapman, Peter; Bosveld-de Smet, Leonie; Giardino, Valeria; Corter, James; Linker, Sven. Cham: Springer, 402−418. (Lecture Notes in Artificial Intelligence; 12169). DOI: 10.1007/978-3-030-54249-8_32.
3.1.
2020
Paixão, João; Sobociński, Paweł (2020). Calculational proofs in relational graphical linear algebra. Formal Methods: Foundations and Applications : 23rd Brazilian Symposium, SBMF 2020, Ouro Preto, Brazil, November 25-27, 2020, Proceedings. Ed. Carvalho, Gustavo; Stolz, Volker. Cham: Springer, 83−100. (Lecture Notes in Computer Science; 12475). DOI: 10.1007/978-3-030-63882-5_6.
1.2.
2019
Bonchi, Filippo; Holland, Joshua; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio (2019). Diagrammatic algebra: from linear to concurrent systems. Proceedings of the ACM on Programming Languages, 3 (POPL), Art no 25, 1−28. DOI: 10.1145/3290338.
3.1.
2019
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio (2019). Graphical Affine Algebra. 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York: IEEE, art. no. 8785877. DOI: 10.1109/LICS.2019.8785877.
3.1.
2019
Bonchi, Filippo; Seeber, Jens; Sobociński, Paweł (2019). The axiom of choice in cartesian bicategories. In: Roggenbach, Markus; Sokolova, Ana (Ed.). 8th Conference on Algebra and Coalgebra in Computer Science : CALCO 2019, June 3-6, 2019, London, United Kingdom (art. no. 15). Saarbrücken/Wadern: Dagstuhl Publishing, Germany. (Leibniz International Proceedings in Informatics; 139). DOI: 10.4230/LIPIcs.CALCO.2019.15.
3.1.
2019
Sobociński, Paweł; Wilson, Paul W.; Zanasi, Fabio (2019). CARTOGRAPHER: A tool for string diagrammatic reasoning. 8th Conference on Algebra and Coalgebra in Computer Science : CALCO 2019, June 3-6, 2019, London, United Kingdom. Ed. Roggenbach, Markus; Sokolova, Ana. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 20:1−20:7. (Leibniz International Proceedings in Informatics; 139). DOI: 10.4230/LIPIcs.CALCO.2019.20.
3.1.
2019
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio; (2019). Bialgebraic semantics for string diagrams. 30th International Conference on Concurrency Theory : CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. Ed. Fokkink, Wan; van Glabbeek, Rob. Saarbrücken/Wadern: Dagstuhl Publishing, German, 37:1−37:17. (Leibniz International Proceedings in Informatics; 140). DOI: 10.4230/LIPIcs.CONCUR.2019.37.
5.2.
2019
Sobociński, Paweł (2019). A compositional approach to signal flow graphs. 31st Nordic Workshop on Programming Theory, NWPT 2019 : Tallinn, Estonia, 13-15 November 2019, Abstracts. Ed. Uustalu, Tarmo; Vain, Jüri. Tallinn: Department of Software Science, Tallinn University of Technology, 2.
1.1.
2018
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2018). Deconstructing Lawvere with distributive laws. Journal of Logical and Algebraic Methods in Programming, 95, 128−146. DOI: 10.1016/j.jlamp.2017.12.002.
3.1.
2018
Behr, Nicolas; Sobociński, Paweł (2018). Rule algebras for adhesive categories. 27th EACSL Annual Conference on Computer Science Logic (CSL 2018) : September 4-7, 2018 - Birmingham, GB. Ed. Ghica, Dan.; Jung, Achim. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 11:1−11:21. (Leibniz International Proceedings in Informatics; 119). DOI: 10.4230/LIPIcs.CSL.2018.11.
3.1.
2018
Bonchi, Filippo; Seeber, Jens; Sobociński, Paweł (2018). Graphical conjunctive queries. 27th EACSL Annual Conference on Computer Science Logic (CSL 2018) : September 4-7, 2018 - Birmingham, GB. Ed. Ghica, Dan.; Jung, Achim. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 13:1−13:23. (Leibniz International Proceedings in Informatics; 119). DOI: 10.4230/LIPIcs.CSL.2018.13.
3.1.
2018
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobociński, Paweł; Zanasi, Fabio (2018). Rewriting with Frobenius. Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018) : Oxford, United Kingdom, July, 2018: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), 9 - 12 July 2018, Oxford, UK. Ed. Dawar, Anuj; Grädel, Erich. New York, NY: Association for Computing Machinery, 165−174. DOI: 10.1145/3209108.3209137.
3.1.
2018
Chantawibul, Apiwat; Sobociński, Paweł; (2018). Monoidal multiplexing. Theoretical Aspects of Computing - ICTAC 2018 : 15th International Colloquium, Stellenbosch, South Africa, October 16-19, 2018, Proceedings. Ed. Fischer, Bernd; Uustalu, Tarmo. Cham: Springer, 116−131. (Lecture Notes in Computer Science; 11187). DOI: 10.1007/978-3-030-02508-3_7.
1.1.
2017
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2017). The Calculus of Signal Flow Diagrams I: Linear relations on streams. Information and Computation, 252, 2−29. DOI: 10.1016/j.ic.2016.03.002.
1.1.
2017
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2017). Interacting Hopf algebras. Journal of Pure and Applied Algebra, 221 (1), 144−184. DOI: 10.1016/j.jpaa.2016.06.002.
3.1.
2017
Bonchi, Filippo; Holland, Joshua; Pavlovic, Dusko; Sobociński, Paweł (2017). Refinement for signal flow graphs. 28th International Conference on Concurrency Theory (CONCUR 2017) : September 5-8, 2017 - Berlin, Germany. Ed. Meyer, Roland; Nestmann, Uwe. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 24:1−24:16. (Leibniz International Proceedings in Informatics; 85). DOI: 10.4230/LIPIcs.CONCUR.2017.24.
3.1.
2017
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobociński, Paweł; Zanasi, Fabio (2017). Confluence of graph rewriting with interfaces. Programming Languages and Systems : 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017, Proceedings. Ed. Yang, Hongseok. Berlin: Springer, 141−169. (Lecture Notes in Computer Science; 10201). DOI: 10.1007/978-3-662-54434-1_6.
6.8.
2017
Sobociński, Paweł (2017). From Wires to Circuits Through Nets. Proceedings 10th Interaction and Concurrency Experience Neuchâtel : Switzerland, 21-22nd June 2017. Ed. Bartoletti, Massimo; Bocchi, Laura; Henrio, Ludovic; Knight, Sophia. Sydney: Open Publishing Association, 3−4. (Electronic Proceedings in Theoretical Computer Science; 261).
3.1.
2016
Sobociński, Paweł (2016). Compositional model checking of concurrent systems, with Petri nets. Proceedings of the Eleventh International Workshop on Developments in Computational Models : Cali, Colombia, October 28, 2015. Ed. Muñoz, César A.; Pérez, Jorge A. Sydney: Open Publishing Association, 19−30. (Electronic Proceedings in Theoretical Computer Science; 204). DOI: 10.4204/EPTCS.204.3.
3.1.
2016
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobociński, Paweł; Zanasi, Fabio (2016). Rewriting modulo symmetric monoidal structure. Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, 05-08-July-2016. New York: ACM, 710−719. DOI: 10.1145/2933575.2935316.
3.1.
2016
Fong, Brendan; Sobociński, Paweł; Rapisarda, Paolo (2016). A categorical approach to open and interconnected dynamical systems. Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, 05-08-July-2016. New York: ACM, 495−504. DOI: 10.1145/2933575.2934556.
3.1.
2016
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2016). Lawvere Categories as Composed PROPs. Coalgebraic Methods in Computer Science : 13th IFIP WG 1.3 International Workshop, CMCS 2016, Colocated with ETAPS 2016, Eindhoven, The Netherlands, April 2-3, 2016, Revised Selected Papers. Ed. Hasuo, Ichiro. Cham: Springer, 11−32. (Lecture Notes in Computer Science; 9608). DOI: 10.1007/978-3-319-40370-0_3.
1.1.
2015
Chantawibul, Apiwat; Sobociński, Paweł (2015). Towards Compositional Graph Theory. Electronic Notes in Theoretical Computer Science, 319, 121−136. DOI: 10.1016/j.entcs.2015.12.009.
1.1.
2015
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2015). Full Abstraction for Signal Flow Graphs. ACM SIGPLAN Notices, 50 (1), 515−526. DOI: 10.1145/2775051.2676993.
1.1.
2015
Sobociński, Paweł (2015). Relational presheaves, change of base and weak simulation. Journal of Computer and System Sciences, 81 (5), 901−910. DOI: 10.1016/j.jcss.2014.12.007.
6.8.
2015
Moss, Lawrence S.; Sobociński, Paweł; (2015). Preface. 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015) : June 24-26, 2015, Nijmegen, The Netherlands. Ed. Moss, Lawrence S.; Sobociński, Paweł. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, vii. (Leibniz International Proceedings in Informatics; 35).
1.1.
2014
Baldan, Paolo; Corradini, Andrea; Heindel, Tobias; König, Barbara; Sobociński, Paweł (2014). Processes and unfoldings: concurrent computations in adhesive categories. Mathematical Structures in Computer Science, 24 (4), ARTN e240402. DOI: 10.1017/S096012951200031X.
3.1.
2014
Danos, Vincent; Heckel, Reiko; Sobociński, Paweł (2014). Transformation and refinement of rigid structures. Graph Transformation : 7th International Conference, ICGT 2014, Held as Part of STAF 2014, York, UK, July 22-24, 2014. Proceedings. Ed. Giese, Holger; König, Barbara. Berlin: Springer, 146−160. (Lecture Notes in Computer Science; 8571). DOI: 10.1007/978-3-319-09108-2_10.
3.1.
2014
Sobociński, Paweł; Stephens, Owen; (2014). A programming language for spatial distribution of net systems. Application and Theory of Petri Nets and Concurrency : 35th International Conference, PETRI NETS 2014, Tunis, Tunisia, June 23-27, 2014, Proceedings. Ed. Ciardo, Gianfranco; Kindler, Ekkart. Cham: Springer, 150−169. (Lecture Notes in Computer Science; 8489). DOI: 10.1007/978-3-319-07734-5_9.
3.1.
2014
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2014). Interacting bialgebras are Frobenius. Foundations of Software Science and Computation Structures : 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings. Ed. Muscholl, Anca. Berlin: Springer, 351−365. (Lecture Notes in Computer Science; 8412). DOI: 10.1007/978-3-642-54830-7_23.
3.1.
2014
Hussein, Mudhafar; Heckel, Reiko; Danos, Vincent; Sobociński, Paweł (2014). Modelling adaptive networks: The case of the Petrified Voters. Proceedings of the13th International Workshop on Graph Transformationand Visual Modeling Techniques (GTVMT 2014). Ed. Herrmann, Frank; Sauer, Stefan. Berlin: Universitatsbibliothek TU Berlin, 1−12. (Electronic Communications of the EASST; 67). DOI: 10.14279/tuj.eceasst.67.950.927.
3.1.
2014
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2014). A categorical semantics of signal flow graphs. CONCUR 2014 – Concurrency Theory 25th International Conference, CONCUR 2014 : Rome, Italy, September 2-5, 2014, Proceedings. Ed. Baldan, Paolo; Gorla, Daniele. Berlin: Springer, 435−450. (Lecture Notes in Computer Science; 8704). DOI: 10.1007/978-3-662-44584-6_30.
3.1.
2014
Rathke, Julian; Sobociński, Paweł; Stephens, Owen; (2014). Compositional reachability in petri nets. Reachability Problems : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings. Ed. Ouaknine, Joel; Potapov, Igor; Worrell, James. Cham: Springer, 230−243. (Lecture Notes in Computer Science; 8762). DOI: 10.1007/978-3-319-11439-2_18.
1.1.
2013
Bruni, Roberto; Melgratti, Hernan; Montanari, Ugo; Sobociński, Paweł (2013). Connector algebras for C/E and P/T nets' interactions. Logical Methods in Computer Science, 9 (3), art. no. 16. DOI: 10.2168/LMCS-9(3:16)2013.
3.1.
2013
Sobociński, Paweł (2013). Nets, relations and linking diagrams. Algebra and Coalgebra in Computer Science 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013, Proceedings. Ed. Heckel, Reiko; Milius, Stefan. Heidelberg: Springer, 282−298. (Lecture Notes in Computer Science; 8089). DOI: 10.1007/978-3-642-40206-7_21.
3.1.
2013
Sobociński, Paweł; Stephens, Owen; (2013). Penrose: Putting compositionality to work for petri net reachability. Algebra and Coalgebra in Computer Science 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013, Proceedings. Ed. Heckel, Reiko; Milius, Stefan. Heidelberg: Springer, 346−352. (Lecture Notes in Computer Science; 8089 ). DOI: 10.1007/978-3-642-40206-7_29.
3.1.
2012
Sobociński, Paweł (2012). Relational presheaves as labelled transition systems. Coalgebraic Methods in Computer Science : 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 – April 1, 2012, Revised Selected Papers. Ed. Pattinson, Dirk; Schröder, Lutz. Heidelberg: Springer, 40−50. (Lecture Notes in Computer Science; 7399). DOI: 10.1007/978-3-642-32784-1_3.
1.1.
2011
Heindel, Tobias; Sobociński, Paweł (2011). Being Van Kampen is a Universal property. Logical Methods in Computer Science, 1, Art no 14. DOI: 10.2168/LMCS-7(1:14)2011.
3.1.
2011
Baldan, Paolo; Gadducci, Fabio; Sobociński, Paweł (2011). Adhesivity is not enough: Local Church-Rosser revisited. Mathematical Foundations of Computer Science 2011 : 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. Ed. Murlak, Filip; Sankowski, Piotr. Berlin: Springer, 48−59. (Lecture Notes in Computer Science; 6907). DOI: 10.1007/978-3-642-22993-0_8.
3.1.
2011
Lantair, Jennifer; Sobociński, Paweł; (2011). WiCcA : LLTS generation tool for wire calculus. Algebra and Coalgebra in Computer Science : 4th International Conference, CALCO 2011, Winchester, UK, August 30 – September 2, 2011, Proceedings. Ed. Corradini, Andrea; Klin, Bartek; Cîrstea, Corina. Heidelberg: Springer, 407−412. (Lecture Notes in Computer Science; 6859). DOI: 10.1007/978-3-642-22944-2_31.
1.1.
2010
Rathke, Julian; Sobociński, Paweł (2010). Deriving structural labelled transitions for mobile ambients. Information and Computation, 208 (10), 1221−1242. DOI: 10.1016/j.ic.2010.06.001.
3.1.
2010
Sobociński, Paweł (2010). Representations of Petri Net Interactions. CONCUR 2010 - Concurrency Theory : 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Ed. Gastin, Paul; Laroussinie, François. Berlin: Springer, 554−568. (Lecture Notes in Computer Science; 6269). DOI: 10.1007/978-3-642-15375-4_38.
4.1.
2010
Aceto, Luca; Sobociński, Paweł,Eds. (2010). Proceedings Seventh Workshop on Structural Operational Semantics (SOS '10) : Paris, France, 30 August 2010. Paris: Open Publishing Association.
6.8.
2010
Aceto, Luca; Sobociński, Paweł, Eds. (2010). Preface. Proceedings Seventh Workshop on Structural Operational Semantics (SOS '10) : Paris, France, 30 August 2010. Ed. Aceto,Luca; Sobocinski,Pawel. Paris: Open Publishing Association. (Electronic Proceedings in Theoretical Computer Science; 32).
1.1.
2009
Rathke, Julian; Sobociński, Paweł; (2009). Making the Unobservable, Unobservable. Electronic Notes in Theoretical Computer Science, 229 (3), 131−144. DOI: 10.1016/j.entcs.2009.06.043.
3.1.
2009
Baldan, Paolo; Corradini, Andrea; Heindel, Tobias; Koenig, Barbara; Sobociński, Paweł (2009). Unfolding grammars in adhesive categories. Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings. Ed. Kurz, Alexande; Lenisa, Marina; Tarlecki, Andrzej. Berlin: Springer, 350−353. (Lecture Notes in Computer Science; 5728). DOI: 10.1007/978-3-642-03741-2_24.
3.1.
2009
Sobociński, Paweł (2009). A non-interleaving process calculus for multi-party synchronisation. Proceedings 2nd Interaction and Concurrency Experience Structured Interactions : Bologna, Italy, 31st August 2009. Ed. Bonchi, Filippo; Grohmann, Davide; Spoletini, Paola; Tuosto, Emilio. Sydney: Open Publishing Association, 87−98. (Electronic Proceedings in Theoretical Computer Science; 12). DOI: 10.4204/EPTCS.12.6.
3.1.
2009
Heindel, Tobias; Sobociński, Pawel (2009). Van Kampen Colimits as Bicolimits in Span. Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings. Berlin: Springer, 335−338. (Lecture Notes in Computer Science; 5728). DOI: 10.1007/978-3-642-03741-2_23.
6.8.
2009
Carbone, Marco; Sobociński, Paweł; Valencia, Frank D. (2009). Foreword: Festschrift for Mogens Nielsen's 60th birthday. 410. AMsterdam: Elsevier, 4001−4005. DOI: 10.1016/j.tcs.2009.06.007.
1.1.
2008
Corradini, Andrea; Hermann, Frank; Sobociński, Paweł (2008). Subobject transformation systems. Applied Categorical Structures, 16 (3), 389−419. DOI: 10.1007/s10485-008-9127-6.
3.1.
2008
Rathke, Julian; Sobociński, Paweł (2008). Deriving structural labelled transitions for mobile ambients. CONCUR 2008 - Concurrency Theory : 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings. Ed. van Breugel, Franck; Chechik, Marsha. Berlin: Springer, 462−476. (Lecture Notes in Computer Science; 5201). DOI: 10.1007/978-3-540-85361-9_36.
3.1.
2008
Rathke, Julian; Sobociński, Paweł (2008). Deconstructing behavioural theories of mobility. Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008 : IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. Ed. Ausiello, Giorgio; Karhumäki, Juhani; Mauri, Giancarlo; Ong, Luke. New York: Springer, 507−520. (IFIP International Federation for Information Processing; 273). DOI: 10.1007/978-0-387-09680-3_34.
1.1.
2007
Sobociński, Paweł (2007). A Well-behaved LTS for the Pi-calculus: (Abstract). Electronic Notes in Theoretical Computer Science, 192 (1), 5−11. DOI: 10.1016/j.entcs.2007.10.002.
1.1.
2007
Danos, Vincent; Krivine, Jean; Sobociński, Paweł; (2007). General reversibility. Electronic Notes in Theoretical Computer Science, 175 (3), 75−86. DOI: 10.1016/j.entcs.2006.07.036.
3.1.
2007
Johnstone, Peter T.; Lack, Stephen; Sobociński, Paweł (2007). Quasitoposes, quasiadhesive categories and artin glueing. Algebra and Coalgebra in Computer Science Second International Conference, CALCO 2007 : Bergen, Norway, August 20-24, 2007, Proceedings. Ed. Mossakowski, Till; Montanari, Ugo, Haveraaen, Magne. Berlin: Springer, 312−326. (Lecture Notes in Computer Science; 4624). DOI: 10.1007/978-3-540-73859-6_21.
3.1.
2007
Rathke, Julian; Sassone, Vladimiro; Sobociński, Paweł (2007). Semantic barbs and biorthogonality. Foundations of Software Science and Computational Structures : 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings. Ed. Seidl, Helmut. Berlin: Springer, 302−305. (Lecture Notes in Computer Science; 4423). DOI: 10.1007/978-3-540-71389-0_22.
1.1.
2006
Lack, Stephen; Sobociński, Paweł (2006). Toposes are adhesive. Graph Transformations : Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings. Ed. Corradini, Andrea; Ehrig, Hartmut; Montanari, Ugo; Ribeiro, Leila; Rozenberg, Grzegorz. Berlin: Springer, 184−198. (Lecture Notes in Computer Science; 4178). DOI: 10.1007/11841883_14.
1.1.
2006
Baldan, P; Corradini, A; Heindel, T; Konig, B; Sobociński, P. (2006). Processes for adhesive rewriting systems. Foundations of Software Science and Computation Structures : 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings. Ed. Aceto, Luca; Ingólfsdóttir, Anna. Berlin: Springer, 202−216. (Lecture Notes in Computer Science; 3921). DOI: 10.1007/11690634_14.
3.1.
2006
Sobociński, Paweł (2006). Reversing graph transformations. Proceedings of the Workshop on Petri Nets and Graph Transformation (PNGT 2006). Universitätsbibliothek TU Berlin, 1−7. (Electronic Communications of the EASST; 2). DOI: 10.14279/tuj.eceasst.2.59.
1.1.
2005
Klin, Bartek; Sassone, Vladimiro; Sobociński, Paweł (2005). Labels from reductions: Towards a general theory. In: Fiadeiro, José Luiz; Harman, Neil; Roggenbach, Markus; Rutten, Jan (Ed.). Algebra and Coalgebra in Computer Science : First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings (30−50). Berlin: Springer. (Lecture Notes in Computer Science; 3629). DOI: 10.1007/11548133_2.
1.1.
2005
Bruni, Roberto; Gadducci, Fabio; Montanari, Ugo; Sobociński, Paweł (2005). Deriving weak bisimulation congruences from reduction systems. CONCUR 2005 – Concurrency Theory : 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings, 3653. Ed. Abadi, Martín; de Alfaro, Luca. Berlin: Springer, 293−307. (3653). DOI: 10.1007/11539452_24.
1.1.
2005
Sassone, V.; Sobociński, P. (2005). Locating reaction with 2-categories. Theoretical Computer Science, 333 (1-2), 297−327. DOI: 10.1016/j.tcs.2004.10.025.
1.1.
2005
Sassone, Vladimiro; Sobociński, Paweł (2005). A congruence for Petri nets. Electronic Notes in Theoretical Computer Science, 127 (2), 107−120. DOI: 10.1016/j.entcs.2005.02.008.
3.1.
2005
Sassone, Vladimiro; Sobociński, Paweł (2005). Reactive systems over cospans. LICS 2005: 20th Annual IEEE Symposium on Logic in Computer Science - Proceedings. Los Alamitos: IEEE Computer Society, 311−320. DOI: 10.1109/LICS.2005.40.
3.1.
2005
Lack, Stephen; Sobociński, Paweł (2005). Adhesive and quasiadhesive categories. RAIRO - Theoretical informatics and applications, 39 (3), 511−545. DOI: 10.1051/ita:2005028.
1.1.
2004
Lack, Stephen; Sobociński, Paweł (2004). Adhesive categories. Foundations of Software Science and Computation Structures : 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004, Proceedings. Ed. Walukiewicz, Igor. Berlin: Springer, 273−288. (Lecture Notes in Computer Science; 2987). DOI: 10.1007/978-3-540-24727-2_20.
1.1.
2003
Klin, Bartek; Sobociński, Paweł (2003). Syntactic formats for free - An abstract approach to process equivalence. CONCUR 2003 - Concurrency Theory 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. Ed. Amadio, Roberto; Lugiez, Denis. Berlin: Springer, 72−86. (Lecture Notes in Computer Science; 2761). DOI: 10.1007/978-3-540-45187-7_5.
3.1.
2003
Sassone, Vladimiro; Sobociński, Paweł (2003). Deriving bisimulation congruences: 2-Categories vs precategories. Foundations of Software Science and Computation Structures : 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003, Proceedings. Ed. Gordon, Andrew D. Berlin: Springer, 409−424. (Lecture Notes in Computer Science; 2620). DOI: 10.1007/3-540-36576-1_26.
1.1.
2002
Sassone, Vladimiro; Sobociński, Paweł (2002). Deriving bisimulation congruences: A 2-categorical approach. Electronic Notes in Theoretical Computer Science, 68 (2), 105−123. DOI: 10.1016/S1571-0661(05)80367-6.
25.03.2022

Paweł Maria Sobociński

https://www.etis.ee/CV/Pawel_Sobocinski/eng
3.04.1978
‭+372 5366 6882‬
pawel@cs.ioc.ee
AAK-1370-2020
Scopus Author Id 8406504300

Google Scholar citations
https://scholar.google.com/citations?user=n1k-QJgAAAAJ

Career

Institutions and positions
01.09.2019–...   
Tallinn University of Technology , School of Information Technologies, Department of Software Science, Tenured Full Professor (1,00)
01.12.2017–01.09.2019   
University of Southampton, Associate Professor in Computer Science (1,00)
01.03.2010–01.12.2017   
University of Southampton, Lecturer in Computer Science (1,00)
01.03.2007–01.03.2010   
University of Southampton, Probationary Lecturer in Computer Science (1,00)
01.05.2005–01.03.2007   
University of Cambridge, Research Associate in Computer Science (1,00)
01.12.2004–01.05.2005   
PPS, University of Paris VII, CNRS Postdoc (1,00)
01.07.2004–01.12.2004   
University of Pisa, Postdoctoral Researcher (1,00)
 
 
Education
2000–2004   
PhD in Computer Science, BRICS, University of Aarhus
1996–1999   
Bachelor in Computer Science and Technology, University of Sydney
 
 
R&D related managerial and administrative work
2021−...   
Member of Expert Panel on Computer Science and Informatics, National Science Centre NCN, Poland
2020−...   
Co-organiser of the Online World Seminar on Logic and Semantics (OWLS)
2020−...   
director of PhD programme in ICT, TTU
2020−...   
chair of organizing committe, MFCS 2021
2019−...   
member of the council of the Dept of Software Science, TTU
2018−...   
Associate Editor, Journal, Compositionality
2016−...   
Associate Editor, Journal, Mathematical Structures in Computer Science
2015−...   
Member of IFIP Working Group 2.2, Formal Description of Programming Concepts
2014−...   
Member of IFIP Working Group 1.3, Foundations of System Specification
2022−2022   
Member of Programme Committee, 33rd International Conference on Concurrency Theory (CONCUR 2022)
2022−2022   
Co-Chair, 26th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2023)
2021−2021   
Member of Programme Committee, 32nd International Conference on Concurrency Theory (CONCUR 2021)
2021−2021   
Member of Programme Committee, 12th International Conference on the Theory and Application of Diagrams (Diagrams 2021)
2021−2022   
Member of Programme Committee, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
2021−2022   
Member of Programme Committee, 25th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2022)
2020−2020   
Member of Programme Committee, 25th Annual ACM/IEEE Symposium on Logic in Computer Science (LiCS 2020)
2020−2020   
Member of Programme Committee, 17th International Conference on Quantum and Physics Logic (QPL 2020)
2020−2020   
Member of Programme Committee, 13th International Conference on Graph Transformation (ICGT 2020)
2020−2020   
Member of Programme Committee, Semantic Spaces at the Intersection of NLP, Physics and Cognitive Science (SEMSPACE 2020)
2020−2020   
Member of Programme Committee and organizer, 7th Symposium on Compositional Structures (SYCO 7)
2020−2020   
Member of Programme Committee, 3rd IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, Track B: Logic, Semantics, and Programming Theory (TTCS 2020)
2020−2020   
Chair, 4th Workshop on String Diagrams in Computation, Logic, and Physics (STRINGS 2020)
2019−2019   
Member of Programme Committee, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Track B
2019−2019   
Member of Programme Committee, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
2019−2019   
Member of Programme Committee, 16th International Conference on Quantum and Physics Logic (QPL 2019)
2019−2019   
Member of Programme Committee, 2nd Annual International Conference on Applied Category Theory (ACT 2019)
2019−2019   
Member of Programme Committee, International Conference on Software Testing, Machine Learning and Complex Process Analysis (TMPA 2019)
2019−2019   
Member of Programme Committee, Semantic Spaces at the Intersection of NLP, Physics and Cognitive Science 2019 (SEMSPACE 2019)
2019−2019   
Programme Committee Chair, 3rd Workshop on String Diagrams in Computation, Logic and Physics (STRINGS 2019)
2019−2019   
Member of Programme Committee, 6th Symposium on Compositional Structures (SYCO 6)
2018−2018   
Member of Programme Committee, 15th International Conference on Quantum Physics and Logic (QPL 2018)
2018−2018   
Member of Programme Committee, 29th Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2018)
2018−2018   
Member of Programme Committee, 24th International Workshop on Algebraic Development Techniques (WADT 2018)
2018−2018   
Member of Programme Committee, 4th Workshop on Higher Dimensional Rewriting and Aplications (HDRA 2018)
2018−2018   
Member of Programme Committee, 1st Symposium on Compositional Structures (SYCO 1)
2018−2018   
Member of Programme Committee, 2nd Symposium on Compositional Structures (SYCO 2)
2018−2018   
Member of Programme Committee, Workshop on Compositional Approaches in Physics, NLP, and the Social Sciences
2018−2018   
Chair, NII Shonan meeting on Diagrammatic Methods for Linear and Nonlinear Systems
2017−2017   
Member of Programme Committee, 14th Conference on Quantum Physics and Logic (QPL 2017)
2017−2017   
Member of Programme Committee, 28th Conference on Concurrency Theory (CONCUR 2017)
2017−2017   
Member of Programme Committee, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
2017−2017   
Member of Programme Committee, 28th Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2017)
2017−2017   
Member of Programme Committee, 4th International Conference on Tools and Methods of Program Analysis (TMPA 2017)
2017−2017   
Member of Programme Committee, 1st Workshop on Recent Advances in Concurrency and Logic (RADICAL 2017)
2017−2017   
Member of Programme Committee, 3rd Workshop on Higher-Dimensional Rewriting and Applications (HDRA 2017)
2017−2017   
Chair, 1st Workshop on String Diagrams in Computation, Logic, and Physics (STRINGS 2017)
2017−2017   
Member of Programme Committee, Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics (EXPRESS/SOS 2017)
2017−2017   
Member of Programme Committee, 3rd International Workshop on Meta Models for Process Languages (MeMo 2017)

Qualifications

Academic degrees
Paweł Maria Sobociński, Doctor's Degree, 2004, (sup) Mogens Nielsen, Deriving process congruences from reaction rules, University of Aarhus.
 
 
Honours & awards
2021, Paweł Maria Sobociński, invited tutorial speaker, XXXVII Mathematical Foundations of Programming Semantics (MFPS 21)
2019, Paweł Maria Sobociński, Invited speaker, 31st Nordic Workshop on Programming Theory, NWPT'19
2019, Paweł Maria Sobociński, Invited speaker, International Category Theory Conference 2019
2018, Paweł Maria Sobociński, Invited speaker, 2nd Workshop on Open Games
2018, Paweł Maria Sobociński, Invited Lecturer, Applied Category Theory Research School, Lorentz Center, Leiden, Netherlands
2017, Paweł Maria Sobociński, Invited tutorial speaker, 28th Int. Conference on Concurrency Theory (CONCUR 2017)
2017, Paweł Maria Sobociński, Invited speaker, Workshop on Compositional Methods for Network Diagrams and Component-Based Systems, Bellairs Institute
2017, Paweł Maria Sobociński, Invited speaker, Workshop on Hopf Algebras in Kitaev’s Quantum Double Models: Mathematical Connections from Gauge Theory to Topological Quantum Computing and Categorical Quantum Mechanics, Perimeter Intitute
2017, Paweł Maria Sobociński, Invited speaker, 10th Interaction and Concurrency Experience (ICE 2017)
2017, Paweł Maria Sobociński, Invited lecturer, 2017 Midlands Graduate School (MGS 2017)
2017, Paweł Maria Sobociński, Invited lecturer, 22nd Estonian Winter School in Computer Science (EWSCS 2017)
2017, Paweł Maria Sobociński, Invited lecturer, PhD-open, Open lectures for PhD students in computer science, University of Warsaw
2016, Paweł Maria Sobociński, Invited speaker, Workshop on Compositionality, Simons Institute
2016, Paweł Maria Sobociński, Invited speaker, 2nd Workshop on Higher-Dimensional Rewriting and Applications (HDRA 2016)
2015, Paweł Maria Sobociński, Invited speaker, 11th International Workshop on Developments in Computational Models (DCM 2015)
2015, Paweł Maria Sobociński, Invited tutorial speaker, 12th Int. Conference on Quantum Physics and Logic (QPL 2015)
 
 
Fields of research
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.6. Computer Sciences; CERCS CLASSIFICATION: P170 Computer science, numerical analysis, systems, control ; SPECIFICATION: applied category theory
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.4. Mathematics; CERCS CLASSIFICATION: P110 Mathematical logic, set theory, combinatories
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.4. Mathematics; CERCS CLASSIFICATION: P120 Number theory, field theory, algebraic geometry, algebra, group theory
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.6. Computer Sciences; CERCS CLASSIFICATION: P175 Informatics, systems theory
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.6. Computer Sciences; CERCS CLASSIFICATION: P176 Artificial intelligence
 
 
Additional information

Projects in progress

Dissertations under supervision

Supervised dissertations

Supervision of postdoctoral researchers

  • 01.11.2019−30.06.2022    Edward Morehouse  "arvutiteadus" (Tallinn University of Technology)
  • 01.01.2020−30.06.2022    Fosco Loregian  "arvutiteadus" (Tallinn University of Technology)
  • 01.10.2020−30.09.2022    Amar Hadzihasanovic  "arvutiteadus" (Tallinn University of Technology)

Publications

Category
Year
Publication
 
1.1.
2022
Paixão, João; Rufino, Lucas; Sobociński, Paweł (2022). High-level axioms for graphical linear algebra. Science of Computer Programming, 102791. DOI: 10.1016/j.scico.2022.102791.
1.1.
2022
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobocinski, Pawel; Zanasi, Fabio (2022). String diagram rewrite theory I: rewriting with Frobenius structure. Journal of the ACM, 69 (2), 1−58. DOI: 10.1145/3502719.
1.1.
2021
di Liberti, Ivan; Loregian, Fosco; Nester, Chad; Sobociński, Paweĺ (2021). Functorial semantics for partial theories. Proceedings of the ACM on Programming Languages, 5 (POPL), art. 57, 28 pp. DOI: 10.1145/3434338.
1.1.
2021
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Pawel; Zanasi, Fabio; (2021). Bialgebraic foundations for the operational semantics of string diagrams. Information and Computation, 104767. DOI: 10.1016/j.ic.2021.104767.
3.1.
2021
Di Lavore, Elena; Hedges, Jules; Sobociński, Paweł (2021). Compositional modelling of games on networks. 29th EACSL Annual Conference on Computer Science Logic (CSL 2021) : January 25-28, 2021, Ljubljana, Slovenia. Ed. Baier, Christel; Goubault-Larrecq, Jean. Saarbrücken/Wadern: Dagstuhl Publishing, 30:1−30:24. (Leibniz International Proceedings in Informatics; 183). DOI: 10.4230/LIPIcs.CSL.2021.30.
3.1.
2021
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2021). A survey of Compositional signal flow theory. Advancing Research in Information and Communication Technology : IFIP's Exciting First 60+ Years, Views from the Technical Committees and Working Groups. Ed. Goedicke, Michael; Neuhold, Erich; Rannenberg, Kai;. Cham: Springer, 29−56. (IFIP Advances in Information and Communication Technology; 600). DOI: 10.1007/978-3-030-81701-5_2.
3.1.
2021
Bonchi, Filippo; Santamaria, Alessio; Seeber, Jens; Sobociński, Paweł (2021). On doctrines and Cartesian bicategories. CALCO 2021 : 9th International Conference on Algebra and Coalgebra in Computer Science, Aug 31 - Sep 3, 2021, Salzburg, Austria.Proceedings. Ed. Gadducci, Fabio; Silva, Alexandra. Dagstuhl Publishing, 10:1−10:7. (LIPIcs–Leibniz International Proceedings in Informatics; 211). DOI: 10.4230/LIPIcs.CALCO.2021.10.
3.1.
2021
Boisseau,Guillaume; Sobocinski,Pawel (2021). String diagrammatic electrical circuit theory. Proceedings of the 4th Annual International Applied Category Theory Conference 2021 [ACT 2021] : Cambridge, USA, 12-16 July 2021. Open Publishing Association. (Electronic Proceedings in Theoretical Computer Science) [forthcoming].
3.1.
2021
Bonchi, Filippo; Di Giorgio, Alessandro; Sobociński, Paweł (2021). Diagrammatic polyhedral algebra. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. Ed. Bojańczyk, Mikołaj; Chekuri, Chandra. Saarbrücken/Wadern: Dagstuhl Publishing, 40:1−40:18. (LIPIcs–Leibniz International Proceedings in Informatics; 213). DOI: 10.4230/LIPIcs.FSTTCS.2021.40.
3.1.
2021
Di Lavore, Elena; Gianola, Alessandro; Roman, Mario; Sabadini, Nicoletta; Sobocinski, Pawel (2021). A canonical algebra of open transition systems. Formal Aspects Of Component Software (Facs 2021): 17th International Conference on Formal Aspects of Component Software (FACS), OCT 28-29, 2021, ELECTR NETWORK. Ed. Salaun, G.; Wijs, A. Cham: Springer, 63−81. (Lecture Notes in Computer Science; 13077). DOI: 10.1007/978-3-030-90636-8_4.
1.1.
2020
Behr, Nicolas; Soboćinski, Paweĺ (2020). Rule algebras for adhesive categories. Logical Methods in Computer Science, 16 (3), 2:1−2:38. DOI: 10.23638/lmcs-16(3:2)2020.
3.1.
2020
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio (2020). Contextual equivalence for signal flow graphs. Foundations of Software Science and Computation Structures : 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Ed. Goubault-Larrecq, Jean; König, Barbara. Cham: Springer, 77−96. (Lecture Notes in Computer Science; 12077). DOI: 10.1007/978-3-030-45231-5_5.
3.1.
2020
Haydon, Nathan; Sobociński, Paweł (2020). Compositional diagrammatic first-order logic. Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings. Ed. Pietarinen, Ahti-Veikko; Chapman, Peter; Bosveld-de Smet, Leonie; Giardino, Valeria; Corter, James; Linker, Sven. Cham: Springer, 402−418. (Lecture Notes in Artificial Intelligence; 12169). DOI: 10.1007/978-3-030-54249-8_32.
3.1.
2020
Paixão, João; Sobociński, Paweł (2020). Calculational proofs in relational graphical linear algebra. Formal Methods: Foundations and Applications : 23rd Brazilian Symposium, SBMF 2020, Ouro Preto, Brazil, November 25-27, 2020, Proceedings. Ed. Carvalho, Gustavo; Stolz, Volker. Cham: Springer, 83−100. (Lecture Notes in Computer Science; 12475). DOI: 10.1007/978-3-030-63882-5_6.
1.2.
2019
Bonchi, Filippo; Holland, Joshua; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio (2019). Diagrammatic algebra: from linear to concurrent systems. Proceedings of the ACM on Programming Languages, 3 (POPL), Art no 25, 1−28. DOI: 10.1145/3290338.
3.1.
2019
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio (2019). Graphical Affine Algebra. 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York: IEEE, art. no. 8785877. DOI: 10.1109/LICS.2019.8785877.
3.1.
2019
Bonchi, Filippo; Seeber, Jens; Sobociński, Paweł (2019). The axiom of choice in cartesian bicategories. In: Roggenbach, Markus; Sokolova, Ana (Ed.). 8th Conference on Algebra and Coalgebra in Computer Science : CALCO 2019, June 3-6, 2019, London, United Kingdom (art. no. 15). Saarbrücken/Wadern: Dagstuhl Publishing, Germany. (Leibniz International Proceedings in Informatics; 139). DOI: 10.4230/LIPIcs.CALCO.2019.15.
3.1.
2019
Sobociński, Paweł; Wilson, Paul W.; Zanasi, Fabio (2019). CARTOGRAPHER: A tool for string diagrammatic reasoning. 8th Conference on Algebra and Coalgebra in Computer Science : CALCO 2019, June 3-6, 2019, London, United Kingdom. Ed. Roggenbach, Markus; Sokolova, Ana. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 20:1−20:7. (Leibniz International Proceedings in Informatics; 139). DOI: 10.4230/LIPIcs.CALCO.2019.20.
3.1.
2019
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio; (2019). Bialgebraic semantics for string diagrams. 30th International Conference on Concurrency Theory : CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. Ed. Fokkink, Wan; van Glabbeek, Rob. Saarbrücken/Wadern: Dagstuhl Publishing, German, 37:1−37:17. (Leibniz International Proceedings in Informatics; 140). DOI: 10.4230/LIPIcs.CONCUR.2019.37.
5.2.
2019
Sobociński, Paweł (2019). A compositional approach to signal flow graphs. 31st Nordic Workshop on Programming Theory, NWPT 2019 : Tallinn, Estonia, 13-15 November 2019, Abstracts. Ed. Uustalu, Tarmo; Vain, Jüri. Tallinn: Department of Software Science, Tallinn University of Technology, 2.
1.1.
2018
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2018). Deconstructing Lawvere with distributive laws. Journal of Logical and Algebraic Methods in Programming, 95, 128−146. DOI: 10.1016/j.jlamp.2017.12.002.
3.1.
2018
Behr, Nicolas; Sobociński, Paweł (2018). Rule algebras for adhesive categories. 27th EACSL Annual Conference on Computer Science Logic (CSL 2018) : September 4-7, 2018 - Birmingham, GB. Ed. Ghica, Dan.; Jung, Achim. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 11:1−11:21. (Leibniz International Proceedings in Informatics; 119). DOI: 10.4230/LIPIcs.CSL.2018.11.
3.1.
2018
Bonchi, Filippo; Seeber, Jens; Sobociński, Paweł (2018). Graphical conjunctive queries. 27th EACSL Annual Conference on Computer Science Logic (CSL 2018) : September 4-7, 2018 - Birmingham, GB. Ed. Ghica, Dan.; Jung, Achim. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 13:1−13:23. (Leibniz International Proceedings in Informatics; 119). DOI: 10.4230/LIPIcs.CSL.2018.13.
3.1.
2018
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobociński, Paweł; Zanasi, Fabio (2018). Rewriting with Frobenius. Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018) : Oxford, United Kingdom, July, 2018: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), 9 - 12 July 2018, Oxford, UK. Ed. Dawar, Anuj; Grädel, Erich. New York, NY: Association for Computing Machinery, 165−174. DOI: 10.1145/3209108.3209137.
3.1.
2018
Chantawibul, Apiwat; Sobociński, Paweł; (2018). Monoidal multiplexing. Theoretical Aspects of Computing - ICTAC 2018 : 15th International Colloquium, Stellenbosch, South Africa, October 16-19, 2018, Proceedings. Ed. Fischer, Bernd; Uustalu, Tarmo. Cham: Springer, 116−131. (Lecture Notes in Computer Science; 11187). DOI: 10.1007/978-3-030-02508-3_7.
1.1.
2017
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2017). The Calculus of Signal Flow Diagrams I: Linear relations on streams. Information and Computation, 252, 2−29. DOI: 10.1016/j.ic.2016.03.002.
1.1.
2017
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2017). Interacting Hopf algebras. Journal of Pure and Applied Algebra, 221 (1), 144−184. DOI: 10.1016/j.jpaa.2016.06.002.
3.1.
2017
Bonchi, Filippo; Holland, Joshua; Pavlovic, Dusko; Sobociński, Paweł (2017). Refinement for signal flow graphs. 28th International Conference on Concurrency Theory (CONCUR 2017) : September 5-8, 2017 - Berlin, Germany. Ed. Meyer, Roland; Nestmann, Uwe. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, 24:1−24:16. (Leibniz International Proceedings in Informatics; 85). DOI: 10.4230/LIPIcs.CONCUR.2017.24.
3.1.
2017
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobociński, Paweł; Zanasi, Fabio (2017). Confluence of graph rewriting with interfaces. Programming Languages and Systems : 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017, Proceedings. Ed. Yang, Hongseok. Berlin: Springer, 141−169. (Lecture Notes in Computer Science; 10201). DOI: 10.1007/978-3-662-54434-1_6.
6.8.
2017
Sobociński, Paweł (2017). From Wires to Circuits Through Nets. Proceedings 10th Interaction and Concurrency Experience Neuchâtel : Switzerland, 21-22nd June 2017. Ed. Bartoletti, Massimo; Bocchi, Laura; Henrio, Ludovic; Knight, Sophia. Sydney: Open Publishing Association, 3−4. (Electronic Proceedings in Theoretical Computer Science; 261).
3.1.
2016
Sobociński, Paweł (2016). Compositional model checking of concurrent systems, with Petri nets. Proceedings of the Eleventh International Workshop on Developments in Computational Models : Cali, Colombia, October 28, 2015. Ed. Muñoz, César A.; Pérez, Jorge A. Sydney: Open Publishing Association, 19−30. (Electronic Proceedings in Theoretical Computer Science; 204). DOI: 10.4204/EPTCS.204.3.
3.1.
2016
Bonchi, Filippo; Gadducci, Fabio; Kissinger, Aleks; Sobociński, Paweł; Zanasi, Fabio (2016). Rewriting modulo symmetric monoidal structure. Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, 05-08-July-2016. New York: ACM, 710−719. DOI: 10.1145/2933575.2935316.
3.1.
2016
Fong, Brendan; Sobociński, Paweł; Rapisarda, Paolo (2016). A categorical approach to open and interconnected dynamical systems. Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science, 05-08-July-2016. New York: ACM, 495−504. DOI: 10.1145/2933575.2934556.
3.1.
2016
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2016). Lawvere Categories as Composed PROPs. Coalgebraic Methods in Computer Science : 13th IFIP WG 1.3 International Workshop, CMCS 2016, Colocated with ETAPS 2016, Eindhoven, The Netherlands, April 2-3, 2016, Revised Selected Papers. Ed. Hasuo, Ichiro. Cham: Springer, 11−32. (Lecture Notes in Computer Science; 9608). DOI: 10.1007/978-3-319-40370-0_3.
1.1.
2015
Chantawibul, Apiwat; Sobociński, Paweł (2015). Towards Compositional Graph Theory. Electronic Notes in Theoretical Computer Science, 319, 121−136. DOI: 10.1016/j.entcs.2015.12.009.
1.1.
2015
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2015). Full Abstraction for Signal Flow Graphs. ACM SIGPLAN Notices, 50 (1), 515−526. DOI: 10.1145/2775051.2676993.
1.1.
2015
Sobociński, Paweł (2015). Relational presheaves, change of base and weak simulation. Journal of Computer and System Sciences, 81 (5), 901−910. DOI: 10.1016/j.jcss.2014.12.007.
6.8.
2015
Moss, Lawrence S.; Sobociński, Paweł; (2015). Preface. 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015) : June 24-26, 2015, Nijmegen, The Netherlands. Ed. Moss, Lawrence S.; Sobociński, Paweł. Saarbrücken/Wadern: Dagstuhl Publishing, Germany, vii. (Leibniz International Proceedings in Informatics; 35).
1.1.
2014
Baldan, Paolo; Corradini, Andrea; Heindel, Tobias; König, Barbara; Sobociński, Paweł (2014). Processes and unfoldings: concurrent computations in adhesive categories. Mathematical Structures in Computer Science, 24 (4), ARTN e240402. DOI: 10.1017/S096012951200031X.
3.1.
2014
Danos, Vincent; Heckel, Reiko; Sobociński, Paweł (2014). Transformation and refinement of rigid structures. Graph Transformation : 7th International Conference, ICGT 2014, Held as Part of STAF 2014, York, UK, July 22-24, 2014. Proceedings. Ed. Giese, Holger; König, Barbara. Berlin: Springer, 146−160. (Lecture Notes in Computer Science; 8571). DOI: 10.1007/978-3-319-09108-2_10.
3.1.
2014
Sobociński, Paweł; Stephens, Owen; (2014). A programming language for spatial distribution of net systems. Application and Theory of Petri Nets and Concurrency : 35th International Conference, PETRI NETS 2014, Tunis, Tunisia, June 23-27, 2014, Proceedings. Ed. Ciardo, Gianfranco; Kindler, Ekkart. Cham: Springer, 150−169. (Lecture Notes in Computer Science; 8489). DOI: 10.1007/978-3-319-07734-5_9.
3.1.
2014
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2014). Interacting bialgebras are Frobenius. Foundations of Software Science and Computation Structures : 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings. Ed. Muscholl, Anca. Berlin: Springer, 351−365. (Lecture Notes in Computer Science; 8412). DOI: 10.1007/978-3-642-54830-7_23.
3.1.
2014
Hussein, Mudhafar; Heckel, Reiko; Danos, Vincent; Sobociński, Paweł (2014). Modelling adaptive networks: The case of the Petrified Voters. Proceedings of the13th International Workshop on Graph Transformationand Visual Modeling Techniques (GTVMT 2014). Ed. Herrmann, Frank; Sauer, Stefan. Berlin: Universitatsbibliothek TU Berlin, 1−12. (Electronic Communications of the EASST; 67). DOI: 10.14279/tuj.eceasst.67.950.927.
3.1.
2014
Bonchi, Filippo; Sobociński, Paweł; Zanasi, Fabio (2014). A categorical semantics of signal flow graphs. CONCUR 2014 – Concurrency Theory 25th International Conference, CONCUR 2014 : Rome, Italy, September 2-5, 2014, Proceedings. Ed. Baldan, Paolo; Gorla, Daniele. Berlin: Springer, 435−450. (Lecture Notes in Computer Science; 8704). DOI: 10.1007/978-3-662-44584-6_30.
3.1.
2014
Rathke, Julian; Sobociński, Paweł; Stephens, Owen; (2014). Compositional reachability in petri nets. Reachability Problems : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings. Ed. Ouaknine, Joel; Potapov, Igor; Worrell, James. Cham: Springer, 230−243. (Lecture Notes in Computer Science; 8762). DOI: 10.1007/978-3-319-11439-2_18.
1.1.
2013
Bruni, Roberto; Melgratti, Hernan; Montanari, Ugo; Sobociński, Paweł (2013). Connector algebras for C/E and P/T nets' interactions. Logical Methods in Computer Science, 9 (3), art. no. 16. DOI: 10.2168/LMCS-9(3:16)2013.
3.1.
2013
Sobociński, Paweł (2013). Nets, relations and linking diagrams. Algebra and Coalgebra in Computer Science 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013, Proceedings. Ed. Heckel, Reiko; Milius, Stefan. Heidelberg: Springer, 282−298. (Lecture Notes in Computer Science; 8089). DOI: 10.1007/978-3-642-40206-7_21.
3.1.
2013
Sobociński, Paweł; Stephens, Owen; (2013). Penrose: Putting compositionality to work for petri net reachability. Algebra and Coalgebra in Computer Science 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013, Proceedings. Ed. Heckel, Reiko; Milius, Stefan. Heidelberg: Springer, 346−352. (Lecture Notes in Computer Science; 8089 ). DOI: 10.1007/978-3-642-40206-7_29.
3.1.
2012
Sobociński, Paweł (2012). Relational presheaves as labelled transition systems. Coalgebraic Methods in Computer Science : 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 – April 1, 2012, Revised Selected Papers. Ed. Pattinson, Dirk; Schröder, Lutz. Heidelberg: Springer, 40−50. (Lecture Notes in Computer Science; 7399). DOI: 10.1007/978-3-642-32784-1_3.
1.1.
2011
Heindel, Tobias; Sobociński, Paweł (2011). Being Van Kampen is a Universal property. Logical Methods in Computer Science, 1, Art no 14. DOI: 10.2168/LMCS-7(1:14)2011.
3.1.
2011
Baldan, Paolo; Gadducci, Fabio; Sobociński, Paweł (2011). Adhesivity is not enough: Local Church-Rosser revisited. Mathematical Foundations of Computer Science 2011 : 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. Ed. Murlak, Filip; Sankowski, Piotr. Berlin: Springer, 48−59. (Lecture Notes in Computer Science; 6907). DOI: 10.1007/978-3-642-22993-0_8.
3.1.
2011
Lantair, Jennifer; Sobociński, Paweł; (2011). WiCcA : LLTS generation tool for wire calculus. Algebra and Coalgebra in Computer Science : 4th International Conference, CALCO 2011, Winchester, UK, August 30 – September 2, 2011, Proceedings. Ed. Corradini, Andrea; Klin, Bartek; Cîrstea, Corina. Heidelberg: Springer, 407−412. (Lecture Notes in Computer Science; 6859). DOI: 10.1007/978-3-642-22944-2_31.
1.1.
2010
Rathke, Julian; Sobociński, Paweł (2010). Deriving structural labelled transitions for mobile ambients. Information and Computation, 208 (10), 1221−1242. DOI: 10.1016/j.ic.2010.06.001.
3.1.
2010
Sobociński, Paweł (2010). Representations of Petri Net Interactions. CONCUR 2010 - Concurrency Theory : 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Ed. Gastin, Paul; Laroussinie, François. Berlin: Springer, 554−568. (Lecture Notes in Computer Science; 6269). DOI: 10.1007/978-3-642-15375-4_38.
4.1.
2010
Aceto, Luca; Sobociński, Paweł,Eds. (2010). Proceedings Seventh Workshop on Structural Operational Semantics (SOS '10) : Paris, France, 30 August 2010. Paris: Open Publishing Association.
6.8.
2010
Aceto, Luca; Sobociński, Paweł, Eds. (2010). Preface. Proceedings Seventh Workshop on Structural Operational Semantics (SOS '10) : Paris, France, 30 August 2010. Ed. Aceto,Luca; Sobocinski,Pawel. Paris: Open Publishing Association. (Electronic Proceedings in Theoretical Computer Science; 32).
1.1.
2009
Rathke, Julian; Sobociński, Paweł; (2009). Making the Unobservable, Unobservable. Electronic Notes in Theoretical Computer Science, 229 (3), 131−144. DOI: 10.1016/j.entcs.2009.06.043.
3.1.
2009
Baldan, Paolo; Corradini, Andrea; Heindel, Tobias; Koenig, Barbara; Sobociński, Paweł (2009). Unfolding grammars in adhesive categories. Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings. Ed. Kurz, Alexande; Lenisa, Marina; Tarlecki, Andrzej. Berlin: Springer, 350−353. (Lecture Notes in Computer Science; 5728). DOI: 10.1007/978-3-642-03741-2_24.
3.1.
2009
Sobociński, Paweł (2009). A non-interleaving process calculus for multi-party synchronisation. Proceedings 2nd Interaction and Concurrency Experience Structured Interactions : Bologna, Italy, 31st August 2009. Ed. Bonchi, Filippo; Grohmann, Davide; Spoletini, Paola; Tuosto, Emilio. Sydney: Open Publishing Association, 87−98. (Electronic Proceedings in Theoretical Computer Science; 12). DOI: 10.4204/EPTCS.12.6.
3.1.
2009
Heindel, Tobias; Sobociński, Pawel (2009). Van Kampen Colimits as Bicolimits in Span. Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings. Berlin: Springer, 335−338. (Lecture Notes in Computer Science; 5728). DOI: 10.1007/978-3-642-03741-2_23.
6.8.
2009
Carbone, Marco; Sobociński, Paweł; Valencia, Frank D. (2009). Foreword: Festschrift for Mogens Nielsen's 60th birthday. 410. AMsterdam: Elsevier, 4001−4005. DOI: 10.1016/j.tcs.2009.06.007.
1.1.
2008
Corradini, Andrea; Hermann, Frank; Sobociński, Paweł (2008). Subobject transformation systems. Applied Categorical Structures, 16 (3), 389−419. DOI: 10.1007/s10485-008-9127-6.
3.1.
2008
Rathke, Julian; Sobociński, Paweł (2008). Deriving structural labelled transitions for mobile ambients. CONCUR 2008 - Concurrency Theory : 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings. Ed. van Breugel, Franck; Chechik, Marsha. Berlin: Springer, 462−476. (Lecture Notes in Computer Science; 5201). DOI: 10.1007/978-3-540-85361-9_36.
3.1.
2008
Rathke, Julian; Sobociński, Paweł (2008). Deconstructing behavioural theories of mobility. Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008 : IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. Ed. Ausiello, Giorgio; Karhumäki, Juhani; Mauri, Giancarlo; Ong, Luke. New York: Springer, 507−520. (IFIP International Federation for Information Processing; 273). DOI: 10.1007/978-0-387-09680-3_34.
1.1.
2007
Sobociński, Paweł (2007). A Well-behaved LTS for the Pi-calculus: (Abstract). Electronic Notes in Theoretical Computer Science, 192 (1), 5−11. DOI: 10.1016/j.entcs.2007.10.002.
1.1.
2007
Danos, Vincent; Krivine, Jean; Sobociński, Paweł; (2007). General reversibility. Electronic Notes in Theoretical Computer Science, 175 (3), 75−86. DOI: 10.1016/j.entcs.2006.07.036.
3.1.
2007
Johnstone, Peter T.; Lack, Stephen; Sobociński, Paweł (2007). Quasitoposes, quasiadhesive categories and artin glueing. Algebra and Coalgebra in Computer Science Second International Conference, CALCO 2007 : Bergen, Norway, August 20-24, 2007, Proceedings. Ed. Mossakowski, Till; Montanari, Ugo, Haveraaen, Magne. Berlin: Springer, 312−326. (Lecture Notes in Computer Science; 4624). DOI: 10.1007/978-3-540-73859-6_21.
3.1.
2007
Rathke, Julian; Sassone, Vladimiro; Sobociński, Paweł (2007). Semantic barbs and biorthogonality. Foundations of Software Science and Computational Structures : 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings. Ed. Seidl, Helmut. Berlin: Springer, 302−305. (Lecture Notes in Computer Science; 4423). DOI: 10.1007/978-3-540-71389-0_22.
1.1.
2006
Lack, Stephen; Sobociński, Paweł (2006). Toposes are adhesive. Graph Transformations : Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings. Ed. Corradini, Andrea; Ehrig, Hartmut; Montanari, Ugo; Ribeiro, Leila; Rozenberg, Grzegorz. Berlin: Springer, 184−198. (Lecture Notes in Computer Science; 4178). DOI: 10.1007/11841883_14.
1.1.
2006
Baldan, P; Corradini, A; Heindel, T; Konig, B; Sobociński, P. (2006). Processes for adhesive rewriting systems. Foundations of Software Science and Computation Structures : 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings. Ed. Aceto, Luca; Ingólfsdóttir, Anna. Berlin: Springer, 202−216. (Lecture Notes in Computer Science; 3921). DOI: 10.1007/11690634_14.
3.1.
2006
Sobociński, Paweł (2006). Reversing graph transformations. Proceedings of the Workshop on Petri Nets and Graph Transformation (PNGT 2006). Universitätsbibliothek TU Berlin, 1−7. (Electronic Communications of the EASST; 2). DOI: 10.14279/tuj.eceasst.2.59.
1.1.
2005
Klin, Bartek; Sassone, Vladimiro; Sobociński, Paweł (2005). Labels from reductions: Towards a general theory. In: Fiadeiro, José Luiz; Harman, Neil; Roggenbach, Markus; Rutten, Jan (Ed.). Algebra and Coalgebra in Computer Science : First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings (30−50). Berlin: Springer. (Lecture Notes in Computer Science; 3629). DOI: 10.1007/11548133_2.
1.1.
2005
Bruni, Roberto; Gadducci, Fabio; Montanari, Ugo; Sobociński, Paweł (2005). Deriving weak bisimulation congruences from reduction systems. CONCUR 2005 – Concurrency Theory : 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings, 3653. Ed. Abadi, Martín; de Alfaro, Luca. Berlin: Springer, 293−307. (3653). DOI: 10.1007/11539452_24.
1.1.
2005
Sassone, V.; Sobociński, P. (2005). Locating reaction with 2-categories. Theoretical Computer Science, 333 (1-2), 297−327. DOI: 10.1016/j.tcs.2004.10.025.
1.1.
2005
Sassone, Vladimiro; Sobociński, Paweł (2005). A congruence for Petri nets. Electronic Notes in Theoretical Computer Science, 127 (2), 107−120. DOI: 10.1016/j.entcs.2005.02.008.
3.1.
2005
Sassone, Vladimiro; Sobociński, Paweł (2005). Reactive systems over cospans. LICS 2005: 20th Annual IEEE Symposium on Logic in Computer Science - Proceedings. Los Alamitos: IEEE Computer Society, 311−320. DOI: 10.1109/LICS.2005.40.
3.1.
2005
Lack, Stephen; Sobociński, Paweł (2005). Adhesive and quasiadhesive categories. RAIRO - Theoretical informatics and applications, 39 (3), 511−545. DOI: 10.1051/ita:2005028.
1.1.
2004
Lack, Stephen; Sobociński, Paweł (2004). Adhesive categories. Foundations of Software Science and Computation Structures : 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004, Proceedings. Ed. Walukiewicz, Igor. Berlin: Springer, 273−288. (Lecture Notes in Computer Science; 2987). DOI: 10.1007/978-3-540-24727-2_20.
1.1.
2003
Klin, Bartek; Sobociński, Paweł (2003). Syntactic formats for free - An abstract approach to process equivalence. CONCUR 2003 - Concurrency Theory 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. Ed. Amadio, Roberto; Lugiez, Denis. Berlin: Springer, 72−86. (Lecture Notes in Computer Science; 2761). DOI: 10.1007/978-3-540-45187-7_5.
3.1.
2003
Sassone, Vladimiro; Sobociński, Paweł (2003). Deriving bisimulation congruences: 2-Categories vs precategories. Foundations of Software Science and Computation Structures : 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003, Proceedings. Ed. Gordon, Andrew D. Berlin: Springer, 409−424. (Lecture Notes in Computer Science; 2620). DOI: 10.1007/3-540-36576-1_26.
1.1.
2002
Sassone, Vladimiro; Sobociński, Paweł (2002). Deriving bisimulation congruences: A 2-categorical approach. Electronic Notes in Theoretical Computer Science, 68 (2), 105−123. DOI: 10.1016/S1571-0661(05)80367-6.
25.03.2022

Otsi projekti

  • {{item.Name}}
Asutus on projekti finantseerija   Asutus on projekti teostaja  
  • {{searchListItem.Name}}
Kõik   Tavaprojektid   Ülemprojektid   Alamprojektid  
Uus Frascati (2015)
Uus ja vana Frascati (otsing uue järgi väljastab ka seotud vanad)
Kõik
Käimasolevad
Lõppenud
Algus
Hajus
Täpne
Uus otsing (Beetaversioon) Lihtotsing Tühjenda
  • Leitud 2 kirjet
ProgrammLiikNumberNimiProjekti algusProjekti lõppVastutav täitjaAsutusFinantseerijapoolne rahastamine
PRGPRG1210Automaadid: õppimine, interaktsioon ja konkurentsus (ALICE)01.01.202131.12.2025Paweł Maria SobocińskiTallinna Tehnikaülikool, Infotehnoloogia teaduskond, Tarkvarateaduse instituut475 750,00 EUR
1.1.5.EITSA18017IT Akadeemia programmi IKT teaduse toetusmeede perioodiks 2018-2022: Tarkvara usaldusväärsus01.01.201831.08.2023Paweł Maria SobocińskiTallinna Tehnikaülikool, Infotehnoloogia teaduskond, Tarkvarateaduse instituut1 864 416,00 EUR