The following pages link to Graph Transformations (Q5292592):
Displayed 21 items.
- Amalgamation of domain specific languages with behaviour (Q347380) (← links)
- Integration of categorical frameworks: Rule-based refinement and hierarchical composition for components (Q934668) (← links)
- Construction and properties of adhesive and weak adhesive high-level replacement categories (Q934669) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems (Q2011208) (← links)
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics (Q2049987) (← links)
- Concurrency theorems for non-linear rewriting theories (Q2117255) (← links)
- Rule-based transformation of graph rewriting rules: towards higher-order graph grammars (Q2355681) (← links)
- Van Kampen Colimits as Bicolimits in Span (Q2888497) (← links)
- Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems (Q2947220) (← links)
- Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
- Rule Algebras for Adhesive Categories (Q3300790) (← links)
- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems (Q3522863) (← links)
- Workshop on Petri Nets and Graph Transformations (Q3540422) (← links)
- (Q5020536) (← links)
- Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics (Q5100733) (← links)
- Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs (Q5404172) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- Fundamentals of compositional rewriting theory (Q6052944) (← links)
- A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs (Q6181929) (← links)
- A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity (Q6199404) (← links)