Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
From MaRDI portal
Publication:3416072
zbMATH Open1106.68055MaRDI QIDQ3416072FDOQ3416072
Authors: Hartmut Ehrig, Karsten Ehrig, Ulrike Prange, Gabriele Taentzer 
Publication date: 19 January 2007
Recommendations
typed attributed graph transformationadhesive HLR categoriescritical pair lemmalocal confluence of transformations
Cited In (18)
- Variability-based model transformation: formal foundation and application
- The Edge of Graph Transformation — Graphs for Behavioural Specification
- The PBPO graph transformation approach
- A general attribution concept for models in \({\mathcal M}\)-adhesive transformation systems
- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
- Modeling dynamic reconfigurations in Reo using high-level replacement systems
- Verification of graph grammars using a logical approach
- A Unified Categorical Approach for Attributed Graph Rewriting
- Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations
- Theorem proving graph grammars with attributes and negative application conditions
- Graph transformations for object-oriented refinement
- Symbolic graphs for attributed graph constraints
- Explicit State Model Checking for Graph Grammars
- Graph Transformations
- Algebraic properties and transformations of monographs
- Attributed graph transformation with node type inheritance
- A graph-based generic type system for object-oriented programs
- High-Level Programs and Program Conditions
This page was built for publication: Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416072)
