1. Filippo Bonchi & Damien Pous (2013): Checking NFA Equivalence with Bisimulations up to Congruences. In: PoPL`13, doi:10.1145/2429069.2429124.
  2. Filippo Bonchi, PawełSobociński & Fabio Zanasi (2014): A Categorical Semantics of Signal Flow Graphs. In: CONCUR`14, LNCS 8704. Springer, pp. 435–450, doi:10.1007/978-3-662-44584-6_30.
  3. Filippo Bonchi, PawełSobociński & Fabio Zanasi (2015): Full Abstraction for Signal Flow Graphs. In: Principles of Programming Languages, POPL`15., doi:10.1145/2676726.2676993.
  4. Roberto Bruni, Hernán C. Melgratti & Ugo Montanari (2011): A Connector Algebra for P/T Nets Interactions. In: Concurrency Theory (CONCUR `11), LNCS 6901. Springer, pp. 312–326, doi:10.1007/978-3-642-23217-6_21.
  5. Roberto Bruni, Hernán C. Melgratti, Ugo Montanari & PawełSobociński (2013): Connector Algebras for C/E and P/T Nets' Interactions. Log. Meth. Comput. Sci. 9(3), doi:10.2168/LMCS-9(3:16)2013.
  6. Apiwat Chantawibul & PawełSobociński (2015): Towards Compositional Graph Theory. In: MFPS XXXI, doi:10.1016/j.entcs.2015.12.009.
  7. Allan Cheng, Javier Esparza & Jens Palsberg (1993): Complexity Results for 1-safe nets. In: FSTTCS, LNCS 761, pp. 326–337, doi:10.1007/3-540-57529-4_66.
  8. Richard Mayr & Lorenzo Clemente (2013): Advanced Automata Minimization. In: PoPL`13, doi:10.1145/2429069.2429079.
  9. Antoni Mazurkiewicz (1987): Compositional semantics of pure place/transition systems. In: Advances in Petri nets, LNCS 340. Springer, pp. 307–330, doi:10.1007/3-540-50580-6_35.
  10. Julian Rathke, PawełSobociński & Owen Stephens (2013): Decomposing Petri nets. Available at ArXiv:1304.3121.
  11. Julian Rathke, PawełSobociński & Owen Stephens (2014): Compositional Reachability in Petri Nets. In: Reachability Problems, LNCS 8762. Springer, pp. 230–243, doi:10.1007/978-3-319-11439-2_18.
  12. PawełSobociński (2010): Representations of Petri net interactions. In: Concurrency Theory (CONCUR `10), LNCS 6269. Springer, pp. 554–568, doi:10.1007/978-3-642-15375-4_38.
  13. Owen Stephens (2015): Compositional Specification and Reachability Checking of Net Systems. ECS, University of Southampton.

Comments and questions to:
For website issues: