The following pages link to (Q3839056):
Displaying 26 items.
- Encoding bigraphical reactive systems into graph transformation systems (Q511000) (← links)
- An axiomatization of graphs (Q707454) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
- Executing bigraphical reactive systems (Q1634767) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- Hypergraph categories (Q2001422) (← links)
- Recognizability of graph and pattern languages (Q2491214) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- Deriving bisimulation congruences: a 2-categorical approach (Q2842606) (← links)
- Adhesive DPO parallelism for monic matches (Q2867888) (← links)
- Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
- Calculating Colimits Compositionally (Q3507390) (← links)
- (Q4381716) (← links)
- (Q4415067) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph). (Q4921560) (← links)
- GETGRATS (Q4923529) (← links)
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure (Q5058366) (← links)
- String Diagram Rewrite Theory I: Rewriting with Frobenius Structure (Q5066951) (← links)
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs (Q5170278) (← links)
- Homotopy composition of cospans (Q5354374) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- A coalgebraic presentation of structured transition systems (Q5941158) (← links)
- Towards compositional graph theory (Q5971395) (← links)
- Monoidal Width (Q6076171) (← links)
- A monoidal view on fixpoint checks (Q6535504) (← links)
