Photo of Pawel Sobocinski

Pawel Sobocinski

Office: Mountbatten 53/4043
Postal Address: ESS, Electronics and Computer Science
University of Southampton
SO17 1BJ United Kingdom
Email:
Bibliometrics: Google Scholar, DBLP

I am on the faculty at the School of Electronics and Computer Science at the University of Southampton. 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
  • 22nd Estonian Winter School in Computer Science (EWSCS 2017), Palmse, Estonia, March 5-10, 2017
  • Midlands Graduate School (MGS 2017), Leicester, UK, April 9-13, 2017
  • 10th Interaction and Concurrency Experience (ICE 2017), Neuchâtel, Switzerland, June 21-22, 2017
  • IFIP WG 1.8 Workshop on Open Problems in Concurrency Theory (OPCT 2017), IST, Austria, June 26-29, 2017
  • Hopf Algebras in Kitaev's Quantum Double Models: Mathematical Connections from Gauge Theory to Topological Quantum Computing and Categorical Quantum Mechanics, Perimeter Institute, Waterloo, Canada, July 31-August 4, 2017
  • Diagrammatic methods for linear and nonlinear systems, Nil Shonan, Japan (organised with Dan Ghica, U. Birmingham and Masahito Hasegawa, U. Kyoto), August 2017, precise dates TBA
  • 28th International Conference on Concurrency Theory (CONCUR 2017), Berlin, Germany, September 5-8, 2017
Organisations
Programme committees

2017

2016

2015

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
2013-Apiwat Chantawibul, ECS, University of Southampton
2016-Josh Holland, ECS, University of Southampton, with Corina Cirstea and Filippo Bonchi
2016-Rachel Day, ECS, University of Southampton, with Julian Rathke
2016-Jens Seeber, IMT School for Advanced Studies Lucca, with Filippo Bonchi
Publications
[1] Bonchi, F., Gadducci, F., Kissinger, A., Sobociński, P. & Zanasi, F. Confluence of Graph Rewriting with Interfaces. In European Symposium on Programming (ESOP 2017), 2017, (To appear).
[2] Bonchi, F., Sobociński, P. & Zanasi, F. Interacting Hopf Algebras. J Pure Appl Alg 221(1):144-184, 2017.
[3] Bonchi, F., Sobociński, P. & Zanasi, F. The Calculus of Signal Flow Diagrams I: Linear Relations on Streams. Inf Comput 252:2-29, 2017.
[4] Bonchi, F., Sobociński, P. & Zanasi, F. Lawvere theories as composed PROPs. In 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2016), LNCS 9608:11-32, Springer, 2016.
[5] Bonchi, F., Gadducci, F., Kissinger, A., Sobociński, P. & Zanasi, F. Rewriting modulo symmetric monoidal structure. In Thirty-first annual ACM/IEEE symposium on Logic and Computer Science (LiCS 2016), pages 710-719, 2016.
[6] Fong, B., Rapisarda, P. & Sobociński, P. A categorical approach to open and interconnected dynamical systems. In Thirty-first annual ACM/IEEE symposium on Logic and Computer Science (LiCS 2016), pages 495-504, 2016.
[7] Sobociński, P. Compositional model checking of concurrent systems, with Petri nets. In 11th International Workshop on Developments in Computational Models, (DCM 2015), EPTCS 204:19-30, 2015.
[8] Chantawibul, A. & Sobociński, P. Towards Compositional Graph Theory. In 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXI), ENTCS 319:121-136, 2015.
[9] Sobociński, P. Relational Presheaves, Change of Base and Weak Simulation. J Comput Syst Sci 81(5):901-910, 2015.
[10] Bonchi, F., Sobociński, P. & Zanasi, F. Full Abstraction for Signal Flow Graphs. In 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (POPL 2015), pages 515-526, ACM, 2015.
[11] Rathke, J., Sobociński, P. & Stephens, O. Compositional Reachability in Petri Nets. In Reachability Problems - 8th International Workshop, (RP 2014), LNCS 8762:230-243, Springer, 2014.
[12] Bonchi, F., Sobociński, P. & Zanasi, F. A Categorical Semantics of Signal Flow Graphs. In Concurrency Theory - 25th International Conference, (CONCUR 2014), LNCS 8704:435-450, Springer, 2014.
[13] Danos, V., Heckel, R. & Sobociński, P. Transformation and Refinement of Rigid Structures. In Graph Transformation - 7th International Conference, (ICGT 2014), LNCS 8571:146-160, Springer, 2014.
[14] Sobociński, P. & Stephens, O. A Programming Language for Spatial Distribution of Net Systems. In Application and Theory of Petri Nets and Concurrency - 35th International Conference, (Petri Nets 2014), LNCS 8489:150-169, Springer, 2014.
[15] Baldan, P., Corradini, A., Heindel, T., König, B. & Sobociński, P. Processes and Unfoldings: Concurrent Computations in Adhesive Categories. Math Struct Comput Sci 24(4), 2014.
[16] Bonchi, F., Sobociński, P. & Zanasi, F. Interacting Bialgebras are Frobenius. In Foundations of Software Science and Computation Structures - 17th International Conference, (FOSSACS 2014), LNCS 8412, Springer, 2014.
[17] Sobociński, P. & Stephens, O. Penrose: Putting compositionality to work for Petri net reachability. In Algebra and Coalgebra in Computer Science - 5th International Conference, (CALCO 2013), LNCS 8089:346-352, Springer, 2013.
[18] Sobociński, P. Nets, relations and linking diagrams. In Algebra and Coalgebra in Computer Science - 5th International Conference, (CALCO 2013), LNCS 8089:282-298, Springer, 2013.
[19] Bruni, R., Melgratti, H.C., Montanari, U. & Sobociński, P. Connector Algebras for C/E and P/T Nets' Interactions. Log Meth Comput Sci 9(3), 2013.
[20] Sobociński, P. Relational Presheaves as Labelled Transition Systems. In Coalgebraic Methods in Computer Science - 11th International Workshop, (CMCS 2012), LNCS 7399:40-50, Springer, 2012.
[21] Baldan, P., Gadducci, F. & Sobociński, P. Adhesivity is not enough: Local Church-Rosser revisited. In Mathematical Foundations of Computer Science 2011 - 36th International Symposium, (MFCS 2011), LNCS 6907:48-59, Springer, 2011.
[22] Lantair, J. & Sobociński, P. WiCcA: LTS generation tool for wire calculus. In Algebra and Coalgebra in Computer Science - 4th International Conference, (CALCO 2011), LNCS 6859:407-412, Springer, 2011.
[23] Sobociński, P. Representations of Petri net interactions. In Concurrency Theory, 21th International Conference, (CONCUR 2010), LNCS 6269:554-568, Springer, 2010.
[24] Heindel, T. & Sobociński, P. Van Kampen colimits as bicolimits in Span. In Algebra and Coalgebra in Computer Science, Third International Conference, (CALCO 2009), LNCS 5728:335-349, Springer, 2009.
[25] Rathke, J. & Sobociński, P. Deriving structural labelled transitions for mobile ambients. Inform. Comput. 208:1221-1242, 2010.
[26] Carbone, M., Sobociński, P. & Valencia, F.D. Foreword: Festschrift for Mogens Nielsen's 60th birthday. Theor Comput Sci 410(41):4001-4005, 2009.
[27] Baldan, P., Corradini, A., Heindel, T., König, B. & Sobociński, P. Unfolding grammars in adhesive categories. In Algebra and Coalgebra in Computer Science, Third International Conference, (CALCO 2009), LNCS 5728:350-366, Springer, 2009.
[28] Rathke, J. & Sobociński, P. Deriving labelled transition systems---a structural approach. EATCS Bulletin 98:107-122, 2009.
[29] Sobociński, P. A non-interleaving process calculus for multi-party synchronisation. In 2nd Interaction and Concurrency Experience: Structured Interactions, (ICE 2009), EPTCS 12, 2009.
[30] Rathke, J. & Sobociński, P. Deconstructing behavioural theories of mobility. In 5th IFIP International Conference on Theoretical Computer Science (TCS '08), IFIP 273:507-520, Springer, 2008.
[31] Rathke, J. & Sobociński, P. Deriving structural labelled transitions for mobile ambients. In Concurrency Theory, 19th International Conference, (CONCUR 2008), LNCS 5201:462-476, Springer, 2008.
[32] Rathke, J. & Sobociński, P. Making the unobservable, unobservable. In 1st Interaction and Concurrency Experience (ICE 2008), ENCTS 229(3):131-144, 2009.
[33] Corradini, A., Hermann, F. & Sobociński, P. Subobject Transformation Systems. Appl Categor Str 16(3):389-419, 2008.
[34] Johnstone, P.T., Lack, S. & Sobociński, P. Quasitoposes, quasiadhesive categories and Artin glueing. In Algebra and Coalgebra in Computer Science, Second International Conference, (CALCO 2007), LNCS 4626:312-326, Springer, 2007.
[35] Sobocinski, P. A well-behaved LTS for the Pi-calculus. In 4th Workshop on Structural Operational Semantics (SOS 2007), ENTCS, 2007.
[36] Rathke, J., Sassone, V. & Sobociński, P. Semantic barbs and biorthogonality. In Foundations of Software Science and Computational Structures, 10th International Conference, (FOSSACS 2007), LNCS 4423:302-316, Springer, 2007.
[37] Sobociński, P. Reversing graph transformations. In 1st Workshop on Petri nets and graph transformations, PNGT '06, Electronic Communications of the EASST 2, 2006.
[38] Baldan, P., Corradini, A., Heindel, T., König, B. & Sobociński, P. Processes for Adhesive Rewriting Systems. In Foundations of Software Science and Computation Structures, 9th International Conference, (FOSSACS 2006), LNCS 3921:202-216, Springer, 2006.
[39] Lack, S. & Sobociński, P. Toposes are adhesive. In Graph Transformations, Third International Conference, (ICGT 2006), LNCS 4178:184-198, Springer, 2006.
[40] Danos, V., Krivine, J. & Sobociński, P. General reversibility. In 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006), ENTCS 175(3):75-86, Elsevier, 2006.
[41] Klin, B., Sassone, V. & Sobociński, P. Labels from reductions: towards a general theory. In Algebra and Coalgebra in Computer Science (CALCO '05), LNCS 3629:30-50, Springer, 2005.
[42] Bruni, R., Gadducci, F., Montanari, U. & Sobociński, P. Deriving weak bisimulation congruences from reduction systems. In Concurrency Theory, 16th International Conference, (CONCUR 2005), LNCS 3653:293-307, Springer, 2005.
[43] Sassone, V. & Sobociński, P. Reactive systems over cospans. In 20th IEEE Symposium on Logic in Computer Science, (LICS 2005), pages 311-320, IEEE Press, 2005.
[44] Sassone, V. & Sobociński, P. Locating reaction with 2-categories. Theor Comput Sci 333(1-2):297-327, 2005.
[45] Lack, S. & Sobociński, P. Adhesive and quasiadhesive categories. RAIRO-Theor Inf Appl 39(3):511-546, 2005.
[46] Sassone, V. & Sobociński, P. A congruence for Petri nets. In Workshop on Petri Nets and Graph Transformations, (PNGT 2004), ENTCS 127:107-120, 2005.
[47] Sobociński, P. Deriving process congruences from reaction rules. PhD Thesis, 2004.
[48] Sobocinski, P. Process congruences from reaction rules. EATCS Bulletin 84, 2004.
[49] Sobocinski, P. Adhesivity, bigraphs and bisimulation congruence. In Dagstuhl Seminar 04241, 2004.
[50] Lack, S. & Sobociński, P. Adhesive categories. In Foundations of Software Science and Computation Structures, 7th International Conference, (FOSSACS 2004), LNCS 2987:273-288, Springer, 2004.
[51] Sassone, V. & Sobociński, P. Deriving bisimulation congruences: 2-categories vs precategories. In Foundations of Software Science and Computational Structures, 6th International Conference, (FOSSACS 2003), LNCS 2620:72-86, Springer, 2003.
[52] Klin, B. & Sobociński, P. Syntactic formats for free: an abstract approach to process equivalence. In Concurrency Theory, 14th International Conference, (CONCUR 2003), LNCS 2620:72-86, Springer, 2003.
[53] Sassone, V. & Sobociński, P. Deriving bisimulation congruences using 2-categories. Nord J Comput 10(2):163-183, 2003.
[54] Sassone, V. & Sobociński, P. Deriving Bisimulation Congruences: A 2-categorical approach. In 9th International Workshop on Expressiveness in Concurrency, (EXPRESS 2002), ENTCS 68, Elsevier, 2002.
[55] Sobociński, P. Synthesising labelled transition systems. MSc Thesis, 2002.