The following pages link to (Q4499230):
Displaying 15 items.
- On the geometry and algebra of networks with state (Q517043) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- Pure bigraphs: structure and dynamics (Q2490119) (← links)
- GS·Λ Theories (Q2842817) (← links)
- Adhesive DPO Parallelism for Monic Matches (Q2867888) (← links)
- Modeling Pointer Redirection as Cyclic Term-graph Rewriting (Q2867899) (← links)
- Bigraphs and Their Algebra (Q2870188) (← links)
- Van Kampen Colimits as Bicolimits in Span (Q2888497) (← links)
- Calculating Colimits Compositionally (Q3507390) (← links)
- A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST (Q4917051) (← links)
- GETGRATS (Q4923529) (← links)
- Categorical rewriting of term-like structures (Q4923533) (← links)
- A Note on an Old-Fashioned Algebra for (Disconnected) Graphs (Q5170278) (← links)
