Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs
DOI10.1016/J.TCS.2012.01.032zbMATH Open1284.68324OpenAlexW1982728514MaRDI QIDQ418014FDOQ418014
Authors: Ulrike Golas, Leen Lambers, Hartmut Ehrig, Fernando Orejas 
Publication date: 14 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.032
Recommendations
inheritance\(M\)-adhesive category with NACscritical pair analysistyped attributed graph transformation
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Special categories (18B99) Abstract data types; algebraic specification (68Q65)
Cites Work
- Handbook of Graph Grammars and Computing by Graph Transformation
- Title not available (Why is that?)
- Formal Methods in Software and Systems Modeling
- Handbook of Graph Grammars and Computing by Graph Transformation
- Attributed graph transformation with node type inheritance
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Fundamentals of algebraic graph transformation
- Partial confluence of processes and systems of objects
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Formal verification of object-oriented graph grammars specifications
- Embedding and Confluence of Graph Transformations with Negative Application Conditions
- Conflict Detection for Graph Transformation with Negative Application Conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal analysis of functional behaviour for model transformations based on triple graph grammars
- Local Confluence for Rules with Nested Application Conditions
- Defining object-oriented execution semantics using graph transformations
- Graph Transformations
- Fundamental Approaches to Software Engineering
- Efficient conflict detection in graph transformation systems by essential critical pairs
- A typed attributed graph grammar with inheritance for the abstract syntax of UML class and sequence diagrams
- Processes, Terms and Cycles: Steps on the Road to Infinity
Cited In (8)
- A logical approach to graph databases
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Amalgamation of domain specific languages with behaviour
- Towards Local Confluence Analysis for Amalgamated Graph Transformation
- Attributed graph transformation with node type inheritance
- Drags: a compositional algebraic framework for graph rewriting
- Rule-based modeling and static analysis of self-adaptive systems by graph transformation
- Polymorphic sesqui-pushout graph rewriting
Uses Software
This page was built for publication: Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418014)
