Multi-amalgamation of rules with application conditions in M-adhesive categories
DOI10.1017/S0960129512000345zbMATH Open1342.68178OpenAlexW2073642557MaRDI QIDQ5740374FDOQ5740374
Authors: Ulrike Golas, Hartmut Ehrig, Annegret Habel
Publication date: 26 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129512000345
Recommendations
- Multi-amalgamation in adhesive categories
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Parallel independence of amalgamated graph transformations applied to model transformation
- scientific article; zbMATH DE number 3907796
- A generalized concurrent rule construction for double-pushout rewriting
Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)
Cites Work
- Correctness of high-level transformation systems relative to nested conditions
- Fundamentals of algebraic graph transformation
- Adhesive and quasiadhesive categories
- Amalgamation of graph transformations: a synchronization mechanism
- Algebraic approach to single-pushout graph transformation
- Parallel independence of amalgamated graph transformations applied to model transformation
- Multi-amalgamation in adhesive categories
Cited In (14)
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Variability-based model transformation: formal foundation and application
- Fundamentals of compositional rewriting theory
- Multi-amalgamation in adhesive categories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amalgamation of domain specific languages with behaviour
- Towards Local Confluence Analysis for Amalgamated Graph Transformation
- Parallel independence of amalgamated graph transformations applied to model transformation
- Finding the right way to Rome: effect-oriented graph transformation
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- A generalized concurrent rule construction for double-pushout rewriting
- Constructing constraint-preserving interaction schemes in adhesive categories
This page was built for publication: Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740374)