-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
From MaRDI portal
Publication:5740375
DOI10.1017/S0960129512000357zbMATH Open1342.68176MaRDI QIDQ5740375FDOQ5740375
Authors: Hartmut Ehrig, Ulrike Golas, Leen Lambers, Fernando Orejas, Annegret Habel 
Publication date: 26 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Recommendations
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- \(\mathcal M, \mathcal N\)-adhesive transformation systems
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- A general attribution concept for models in \({\mathcal M}\)-adhesive transformation systems
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- Transformations and confluence for rewrite systems
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
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
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- Correctness of high-level transformation systems relative to nested conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of algebraic graph transformation
- Title not available (Why is that?)
- Adhesive and quasiadhesive categories
- Graph-based specification of access control policies
- Parallelism and concurrency of graph manipulations
- Parallelism and concurrency in high-level replacement systems
- Amalgamation of graph transformations: a synchronization mechanism
- Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems
- Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars
- Weakest Preconditions for High-Level Programs
- Hereditary pushouts reconsidered
- Parallel independence of amalgamated graph transformations applied to model transformation
- Adhesivity is not enough: local Church-Rosser revisited
- On grammars with local and global context conditions
Cited In (29)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Variability-based model transformation: formal foundation and application
- Multi-amalgamation in adhesive categories
- Initial Conflicts for Transformation Rules with Nested Application Conditions
- Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\mathcal M, \mathcal N\)-adhesive transformation systems
- Inductive Invariant Checking with Partial Negative Application Conditions
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Concurrency theorems for non-linear rewriting theories
- Rule Algebras for Adhesive Categories
- Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction
- Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs
- Formal Methods in Software and Systems Modeling
- Adhesivity is not enough: local Church-Rosser revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Evaluation diversity for graph conditions
- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions
- Constructing optimized constraint-preserving application conditions for model transformation rules
- Title not available (Why is that?)
- Conditional reactive systems
- 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
This page was built for publication: -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740375)
