Photo of Pawel Sobocinski

Pawel Sobocinski

Email:
Bibliometrics: Google Scholar, DBLP

I am Professor of Trustworthy Software Technologies at Taltech. The position is a research measure of the IT Academy programme, funded by the Estonian State and the European Social Fund. I lead the Laboratory for Compositional Systems and Methods.

My research focusses on compositional modelling of systems, developing the underlying mathematics (usually category theory), and applying it to real-life problems such as verification. I work on graph transformation, Petri nets, process algebras, dynamical and cyberphysical systems, as well as mainstream concurrent programming. Since 2015, I write the Graphical Linear Algebra blog about rediscovering linear algebra with string diagrams.

Fibonacci circuit
Upcoming meetings
Recent meetings
Organisations
Programme committees

2020

2019

2018

2017

PhD students
2011-15Owen Stephens, Compositional Specification and Reachability Checking of Net Systems, ECS, University of Southampton, with Julian Rathke
2012-15Fabio Zanasi, Interacting Hopf Algebras: the Theory of Linear Systems, Ecole Normale Supérieure Lyon, with Filippo Bonchi
2016-Josh Holland, ECS, University of Southampton, with Corina Cirstea and Filippo Bonchi
2016-Jens Seeber, IMT School for Advanced Studies Lucca, with Filippo Bonchi
2018-Paul Wilson, ECS, with Fabio Zanasi
2019-Nathan Haydon, TTU
2019-Chad Nester, TTU
2019-Elena di Lavore, TTU
2019-Mario Román, TTU
Publications
  1. Paweł Sobociński, Paul Wilson and Fabio Zanasi, "CARTOGRAPHER: a tool for string diagrammatic reasoning", In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019), 2019. [bibtex]
  2. Filippo Bonchi, Robin Piedeleu, Paweł Sobociński and Fabio Zanasi, "Bialgebraic Semantics for String Diagrams", In 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands., pp. 37:1–37:17, 2019. [bibtex] [pdf] [doi]
  3. Filippo Bonchi, Jens Seeber and Paweł Sobociński, "The Axiom of Choice in Cartesian Bicategories", In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019), 2019. [bibtex] [pdf]
  4. Filippo Bonchi, Robin Piedeleu, Paweł Sobociński and Fabio Zanasi, "Graphical Affine Algebra", In ACM/IEEE Symposium on Logic and Computer Science (LiCS `19), 2019. [bibtex] [pdf]
  5. Filippo Bonchi, Joshua Holland, Robin Piedeleu, Paweł Sobociński and Fabio Zanasi, "Diagrammatic Algebra: From Linear to Concurrent Systems", In 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019), 2019. [bibtex] [pdf]
  6. Apiwat Chantawibul and Paweł Sobociński, "Monoidal multiplexing", In 15th International Colloqium on Theoretical Aspects of Computing, 2018. [bibtex] [pdf]
  7. Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Paweł Sobociński and Fabio Zanasi, "Rewriting with Frobenius", In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), Oxford, UK, July 09-12, 2018, pp. 165–174, 2018. [bibtex] [pdf] [doi]
  8. Filippo Bonchi, Jens Seeber and Paweł Sobociński, "Graphical Conjunctive Queries", In Computer Science Logic 2018 (CSL 2018), 2018. [bibtex] [pdf]
  9. Nicolas Behr and Paweł Sobociński, "Rule Algebras for Adhesive Categories", In Computer Science Logic 2018 (CSL 2018), 2018. [bibtex] [pdf]
  10. Filippo Bonchi, Dusko Pavlovic and Paweł Sobociński, "Functorial Semantics for Relational Theories", In arXiv preprint arXiv:1711.08699, 2017. [bibtex] [pdf]
  11. Filippo Bonchi, Joshua Holland, Dusko Pavlovic and Paweł Sobociński, "Refinement for signal flow graphs", In Concurrency Theory - 28th International Conference, (CONCUR 2017), 2017. [bibtex] [pdf]
  12. Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Paweł Sobociński and Fabio Zanasi, "Confluence of Graph Rewriting with Interfaces", In European Symposium on Programming (ESOP 2017), 2017. [bibtex]
  13. B. Fong, P. Rapisarda and P. Sobociński, "A categorical approach to open and interconnected dynamical systems", In Thirty-first annual ACM/IEEE symposium on Logic and Computer Science (LICS `16), 2016. [bibtex] [pdf]
  14. F. Bonchi, P. Sobociński and F. Zanasi, "Lawvere theories as composed PROPs", In 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS `16), 2016. [bibtex] [pdf]
  15. F. Bonchi, F. Gadducci, A. Kissinger, P. Sobociński and F. Zanasi, "Rewriting modulo symmetric monoidal structure", In Thirty-first annual ACM/IEEE symposium on Logic and Computer Science (LICS `16), 2016. [bibtex] [pdf]
  16. A. Chantawibul and P. Sobociński, "Towards Compositional Graph Theory", In MFPS XXXI, 2015. [bibtex] [pdf]
  17. F. Bonchi, P. Sobociński and F. Zanasi, "The Calculus of Signal Flow Diagrams I: Linear Relations on Streams", 2015. [bibtex] [pdf]
  18. F. Bonchi, P. Sobociński and F. Zanasi, "Full Abstraction for Signal Flow Graphs", In Principles of Programming Languages, POPL`15., 2015. [bibtex] [pdf]
  19. P. Sobociński and O. Stephens, "A Programming Language for Spatial Distribution of Net Systems", In Petri Nets `14, 2014. [bibtex] [pdf]
  20. J. Rathke, P. Sobociński and O. Stephens, "Compositional Reachability in Petri Nets", In Reachability Problems, 2014. [bibtex] [pdf]
  21. V. Danos, R. Heckel and P. Sobociński, "Transformation and Refinement of Rigid Structures", In ICGT`14, 2014. [bibtex] [pdf]
  22. F. Bonchi, P. Sobociński and F. Zanasi, "A Categorical Semantics of Signal Flow Graphs", In CONCUR`14, 2014. [bibtex] [pdf]
  23. F. Bonchi, P. Sobociński and F. Zanasi, "Interacting Hopf Algebras", Technical report, arXiv:1403.7048, 2014. [bibtex] [pdf]
  24. F. Bonchi, P. Sobociński and F. Zanasi, "Interacting Bialgebras are Frobenius", In FoSSaCS `14, 2014. [bibtex] [pdf]
  25. J. Rathke, P. Sobociński and O. Stephens, "Decomposing Petri nets", 2013. [bibtex] [pdf]
  26. P. Sobociński, "Relational Presheaves, Change of Base and Weak Simulation", In JCSS, 2013. [bibtex] [pdf]
  27. P. Sobociński, "Nets, relations and linking diagrams", In Algebra and Coalgebra in Computer Science (CALCO `13), 2013. [bibtex] [pdf]
  28. P. Sobociński and O. Stephens, "Reachability via compositionality in Petri nets", 2013. [bibtex] [pdf]
  29. R. Bruni, H.C. Melgratti, Ugo Montanari and P. Sobociński, "Connector Algebras for C/E and P/T Nets' Interactions", In Log. Meth. Comput. Sci., 2013. [bibtex] [pdf]
  30. P. Sobociński, "Relational presheaves as labelled transition systems", In Coalgebraic Methods in Computer Science (CMCS `12), Springer, vol. 7399, pp. 40-50, 2012. [bibtex]
  31. P. Baldan, A. Corradini, T. Heindel, B. König and P. Sobociński, "Processes and Unfoldings: Concurrent Computations in Adhesive Categories", 2012. [bibtex]
  32. J. Lantair and P. Sobociński, "WiCcA: LTS generation tool for wire calculus", In Algebra and Coalgebra in Computer Science (CALCO Tools `11), Springer, vol. 6859, pp. 407–412, 2011. [bibtex]
  33. T. Heindel and P. Sobociński, "Being Van Kampen is a universal property", In Log. Meth. Comput. Sci., vol. 7, no. 1, 2011. [bibtex] [pdf]
  34. P. Baldan, F. Gadducci and P. Sobociński, "Adhesivitiy is not enough: Local Church-Rosser revisited", In Mathematical Foundations of Computer Science (MFCS `11), Springer, vol. 6907, pp. 48–59, 2011. [bibtex]
  35. P. Sobociński, "Representations of Petri net interactions", In Concurrency Theory (CONCUR `10), Springer, no. 6269, pp. 554–568, 2010. [bibtex] [pdf]
  36. J. Rathke and P. Sobociński, "Deriving structural labelled transitions for mobile ambients", In Information and Computation, vol. 208, pp. 1221-1242, 2010. [bibtex] [pdf]
  37. P. Sobociński, "A non-interleaving process calculus for multi-party synchronisation", In ICE '09, 2009. [bibtex] [pdf]
  38. J. Rathke and P. Sobociński, "Making the unobservable, unobservable", In Proceedings of ICE '08, vol. 229, no. 3, pp. 131–144, 2009. [bibtex] [pdf]
  39. T. Heindel and P. Sobociński, "Van Kampen colimits as bicolimits in Span", In Algebra and Coalgebra in Computer Science (Calco '09), Springer, no. 5728, pp. 335–349, 2009. [bibtex] [pdf]
  40. M. Carbone, P. Sobociński and F. D. Valencia, "Foreword: Festschrift for Mogens Nielsen's 60th birthday", In Theor. Comput. Sci., vol. 410, no. 41, pp. 4001–4005, 2009. [bibtex]
  41. P. Baldan, A. Corradini, T. Heindel, B. König and P. Sobociński, "Unfolding grammars in adhesive categories", In Algebra and Coalgebra in Computer Science (Calco '09), Springer, no. 5728, pp. 350–366, 2009. [bibtex] [pdf]
  42. A. Corradini, F. Hermann and P. Sobociński, "Subobject transformation systems", In Applied Categorical Structures, Kluwer, vol. 16, no. 3, pp. 389–419, 2008. [bibtex]
  43. J. Rathke and P. Sobociński, "Deconstructing behavioural theories of mobility", In Fifth IFIP International Conference On Theoretical Computer Science - TCS '08, Springer, 2008. [bibtex] [pdf]
  44. J. Rathke and P. Sobociński, "Deriving structural labelled transitions for mobile ambients", In Concurrency Theory (CONCUR `08), Springer, vol. 5201, pp. 462–476, 2008. [bibtex] [pdf]
  45. P. Johnstone, S. Lack and P. Sobociński, "Quasitoposes, quasiadhesive categories and Artin glueing", In Algebra and Coalgebra in Computer Science, Calco '07, Springer, vol. 4626, 2007. [bibtex] [pdf]
  46. J. Rathke, V. Sassone and P. Sobociński, "Semantic barbs and biorthogonality", In Foundations of Software Science and Computation Structures, FoSSaCS '07, Springer, vol. 4423, pp. 302–316, 2007. [bibtex] [pdf]
  47. S. Lack and P. Sobociński, "Toposes are adhesive", In International conference on graph transformation, ICGT '06, Springer, vol. 4178, pp. 184–198, 2006. [bibtex] [pdf]
  48. P. Sobociński, "Reversing graph transformations", In Workshop on Petri nets and graph transformations, PNGT '06, vol. 2 (2006), 2006. [bibtex] [pdf]
  49. V. Danos, J. Krivine and P. Sobociński, "General reversibility", In International Workshop on Expressiveness in Concurrency, Express '06, Elsevier, 2006. [bibtex] [pdf]
  50. P. Baldan, A. Corradini, T. Heindel, B. Koenig and P. Sobociński, "Processes for Adhesive Rewriting Systems", In Foundations of Software Science and Computation Structures, FoSSaCS '06, Springer, vol. 3921, pp. 202–216, 2006. [bibtex] [pdf]
  51. V. Sassone and P. Sobociński, "Locating reaction with 2-categories", In Theoretical Computer Science, vol. 333, no. 1-2, pp. 297–327, 2005. [bibtex] [pdf]
  52. V. Sassone and P. Sobociński, "A congruence for Petri nets", In Workshop on Petri nets and graph transformation, PNGT '04, Elsevier, vol. 127, pp. 107–120, 2005. [bibtex] [pdf]
  53. V. Sassone and P. Sobociński, "Reactive Systems over Cospans", In Logic in Computer Science, LiCS '05, IEEE Press, pp. 311–320, 2005. [bibtex] [pdf]
  54. R. Bruni, F. Gadducci, U. Montanari and P. Sobociński, "Deriving weak bisimulation congruences from reduction systems", In International Conference on Concurrency Theory, Concur '05, Springer, vol. 3653, pp. 293–307, 2005. [bibtex] [pdf]
  55. B. Klin, V. Sassone and P. Sobociński, "Labels from reductions: towards a general theory", In Algebra and Coalgebra in Computer Science, Calco '05, Springer, vol. 3629, pp. 30–50, 2005. [bibtex] [pdf]
  56. S. Lack and P. Sobociński, "Adhesive and quasiadhesive categories", In RAIRO - Theoretical Informatics and Applications, EDP Sciences, vol. 39, no. 2, pp. 522–546, 2005. [bibtex] [pdf]
  57. P. Sobociński, "Deriving process congruences from reaction rules", PhD thesis, BRICS, University of Aarhus, 2004. [bibtex] [pdf]
  58. P. Sobociński, "Process congruences from reaction rules (Luca Aceto's Concurrency Column)", In Bulletin of the EATCS, vol. 84, 2004. [bibtex] [pdf]
  59. P. Sobociński, "Adhesivity, bigraphs and bisimulation congruence", In Dagstuhl Seminar 04241, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004. [bibtex] [pdf]
  60. S. Lack and P. Sobociński, "Adhesive categories", In Foundations of Software Science and Computation Structures, FoSSaCS '04, Springer, vol. 2987, pp. 273–288, 2004. [bibtex] [pdf]
  61. V. Sassone and P. Sobociński, "Deriving Bisimulation Congruences Using 2-categories", In Nordic Journal of Computing, vol. 10, no. 2, pp. 163–183, 2003. [bibtex] [pdf]
  62. V. Sassone and P. Sobociński, "Deriving bisimulation congruences: 2-categories vs precategories", In Foundations of Software Science and Computation Structures, FoSSaCS '03, Springer, vol. 2620, 2003. [bibtex] [pdf]
  63. B. Klin and P. Sobociński, "Syntactic Formats for Free: An Abstract Approach to Process Equivalence", In International Conference on Concurrency Theory, Concur '03, Springer, vol. 2620, pp. 72–86, 2003. [bibtex]
  64. V. Sassone and P. Sobociński, "Deriving Bisimulation Congruences: A 2-categorical Approach", In International Workshop on Expressiveness in Concurrency, Express '02, Elsevier, vol. 68, no. 2, 2002. [bibtex] [pdf]