| String Diagram Rewrite Theory I: Rewriting with Frobenius Structure | 0 | 0.34 | 2022 |
| Semantic Modeling of Virtual Reality Training Scenarios. | 0 | 0.34 | 2020 |
| Contextual Equivalence for Signal Flow Graphs | 0 | 0.34 | 2020 |
| Rule Algebras for Adhesive Categories. | 0 | 0.34 | 2020 |
| Graphical Affine Algebra | 0 | 0.34 | 2019 |
| Diagrammatic algebra: from linear to concurrent systems. | 2 | 0.38 | 2019 |
| Bialgebraic Semantics for String Diagrams. | 0 | 0.34 | 2019 |
| CARTOGRAPHER - A Tool for String Diagrammatic Reasoning (Tool Paper). | 0 | 0.34 | 2019 |
| Graphical Conjunctive Queries. | 0 | 0.34 | 2018 |
| Deconstructing Lawvere with distributive laws. | 0 | 0.34 | 2018 |
| Monoidal Multiplexing. | 0 | 0.34 | 2018 |
| Rule Algebras for Adhesive Categories. | 0 | 0.34 | 2018 |
| Semantic 4-dimensional modeling of VR content in a heterogeneous collaborative environment | 0 | 0.34 | 2018 |
| Logging Interactions in Explorable Immersive VR/AR Applications | 0 | 0.34 | 2018 |
| Rewriting with Frobenius. | 0 | 0.34 | 2018 |
| Functorial Semantics for Relational Theories. | 0 | 0.34 | 2017 |
| Refinement for Signal Flow Graphs. | 1 | 0.36 | 2017 |
| Confluence of Graph Rewriting with Interfaces. | 1 | 0.35 | 2017 |
| Rewriting modulo symmetric monoidal structure. | 10 | 0.61 | 2016 |
| Lawvere Categories As Composed Props | 3 | 0.47 | 2016 |
| Full Abstraction for Signal Flow Graphs | 25 | 1.01 | 2015 |
| Relational presheaves, change of base and weak simulation. | 1 | 0.36 | 2015 |
| A categorical approach to open and interconnected dynamical systems | 3 | 0.40 | 2015 |
| Compositional Model Checking Of Concurrent Systems, With Petri Nets | 0 | 0.34 | 2015 |
| Towards Compositional Graph Theory | 0 | 0.34 | 2015 |
| A Categorical Semantics of Signal Flow Graphs. | 17 | 0.94 | 2014 |
| A Programming Language for Spatial Distribution of Net Systems. | 6 | 0.46 | 2014 |
| Interacting Bialgebras Are Frobenius. | 6 | 0.56 | 2014 |
| Interacting Hopf algebras | 5 | 0.57 | 2014 |
| Compositional Reachability in Petri Nets. | 3 | 0.39 | 2014 |
| Processes and unfoldings: concurrent computations in adhesive categories. | 0 | 0.34 | 2014 |
| Penrose: Putting Compositionality to Work for Petri Net Reachability. | 3 | 0.42 | 2013 |
| Decomposing Petri nets | 3 | 0.42 | 2013 |
| Reachability via Compositionality in Petri nets | 5 | 0.53 | 2013 |
| Nets, relations and linking diagrams | 7 | 0.62 | 2013 |
| Connector algebras for C/E and P/T nets' interactions. | 20 | 0.89 | 2013 |
| Relational Presheaves as Labelled Transition Systems. | 10 | 0.60 | 2012 |
| Being Van Kampen is a universal property | 0 | 0.34 | 2011 |
| Adhesivity is not enough: local church-rosser revisited | 3 | 0.39 | 2011 |
| WiCcA: LTS generation tool for wire calculus | 0 | 0.34 | 2011 |
| Representations of Petri net interactions | 25 | 1.07 | 2010 |
| Deriving structural labelled transitions for mobile ambients | 18 | 0.71 | 2010 |
| A Non-Interleaving Process Calculus For Multi-Party Synchronisation | 5 | 0.70 | 2009 |
| Unfolding grammars in adhesive categories | 8 | 0.87 | 2009 |
| Deriving Labelled Transition Systems - A Structural Approach. | 0 | 0.34 | 2009 |
| Making the Unobservable, Unobservable | 4 | 0.43 | 2009 |
| Van Kampen colimits as bicolimits in span | 108 | 3.53 | 2009 |
| Subobject Transformation Systems | 5 | 0.52 | 2008 |
| Deconstructing behavioural theories of mobility | 16 | 0.66 | 2008 |
| A Well-behaved LTS for the Pi-calculus: (Abstract) | 1 | 0.37 | 2007 |
