A general attribution concept for models in M-adhesive transformation systems

DOI10.1007/978-3-642-33654-6_13MaRDI QIDQ2918981zbMATH OpenOpenAlexFDO

Authors Ulrike Golas

Publication date 2 October 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33654-6_13

Mathematics Subject Classification ID

Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categories of machines, automata (18B20) Grammars and rewriting systems (68Q42)

Recommendations

• Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
• Graph Transformations
• A Unified Categorical Approach for Attributed Graph Rewriting
• M, N-adhesive transformation systems
• Towards attributed graphs in Groove (work in progress)

Cited in

(4)

• Graph attribution through sub-graphs
• The PBPO graph transformation approach
• Theorem proving graph grammars with attributes and negative application conditions
• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation

This page was built for publication: A general attribution concept for models in \({\mathcal M}\)-adhesive transformation systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918981)