Pages that link to "Item:Q2491953"
From MaRDI portal
The following pages link to Fundamentals of algebraic graph transformation (Q2491953):
Displaying 50 items.
- Towards ``mouldable code'' via nested code graph transformation (Q406453) (← links)
- Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs (Q418014) (← links)
- Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes (Q418764) (← links)
- A formal approach to the specification and transformation of constraints in MDE (Q444494) (← links)
- Towards the flexible reuse of model transformations: a formal approach based on graph transformation (Q465491) (← links)
- Contextual hyperedge replacement (Q493120) (← links)
- Encoding bigraphical reactive systems into graph transformation systems (Q511000) (← links)
- From imperative to rule-based graph programs (Q516038) (← links)
- Modeling dynamic reconfigurations in Reo using high-level replacement systems (Q608354) (← links)
- A lattice-theoretical perspective on adhesive categories (Q631567) (← links)
- How to delete categorically -- two pushout complement constructions (Q631570) (← links)
- Symbolic graphs for attributed graph constraints (Q631573) (← links)
- A categorical framework for the transformation of object-oriented systems: models and data (Q631577) (← links)
- Algebraic approach to single-pushout graph transformation (Q685460) (← links)
- A formalisation of the copy-modify-merge approach to version control in MDE (Q710677) (← links)
- Partial pushout semantics of generics in DOL (Q724938) (← links)
- Well-structured graph transformation systems (Q729812) (← links)
- A formalisation of deep metamodelling (Q736852) (← links)
- Hybrid search plan generation for generalized graph pattern matching (Q780064) (← links)
- Constructing optimized constraint-preserving application conditions for model transformation rules (Q780069) (← links)
- Attributed graph transformation with node type inheritance (Q882448) (← 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)
- Subobject transformation systems (Q934672) (← links)
- Automating the transformation-based analysis of visual languages (Q973037) (← links)
- Reasoning with graph constraints (Q973044) (← links)
- Consistent integration of models based on views of meta models (Q973049) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
- Graphical reasoning in compact closed categories for quantum computation (Q1044227) (← links)
- Executing bigraphical reactive systems (Q1634767) (← links)
- Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach (Q1734517) (← links)
- An inductive characterization of matching in binding bigraphs (Q1941899) (← links)
- On blow-ups and injectivity of quivers (Q1953529) (← links)
- Probabilistic timed graph transformation systems (Q1994363) (← links)
- A navigational logic for reasoning about graph properties (Q1996850) (← links)
- A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting (Q1998863) (← links)
- Algebraic graph rewriting with controlled embedding (Q2007726) (← links)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems (Q2011208) (← links)
- A structural approach to graph transformation based on symmetric Petri nets (Q2035652) (← links)
- Compositional analysis of probabilistic timed graph transformation systems (Q2044184) (← links)
- A categorial approach to reaction systems: first steps (Q2044950) (← links)
- Confluence up to garbage in graph transformation (Q2049983) (← links)
- Single pushout rewriting in comprehensive systems of graph-like structures (Q2049985) (← links)
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality (Q2049986) (← links)
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics (Q2049987) (← links)
- Comprehensive systems: a formal foundation for multi-model consistency management (Q2065549) (← links)
- Schema compliant consistency management via triple graph grammars and integer linear programming (Q2065551) (← links)
- Language family engineering with product lines of multi-level models (Q2065556) (← links)
- A tale of two graph models: a case study in wireless sensor networks (Q2065559) (← links)