-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation

DOI10.1017/S0960129512000357zbMath1342.68176MaRDI QIDQ5740375

Ulrike Golas, Hartmut Ehrig, Fernando Orejas, Leen Lambers, Annegret Habel

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Categories of machines, automata (18B20)

Related Items (21)

Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs ⋮ Inductive Invariant Checking with Partial Negative Application Conditions ⋮ Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics ⋮ Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Variability-based model transformation: formal foundation and application ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Evaluation diversity for graph conditions ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Rewriting theory for the life sciences: a unifying theory of CTMC semantics ⋮ Constructing optimized constraint-preserving application conditions for model transformation rules ⋮ A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications ⋮ Rule Algebras for Adhesive Categories ⋮ Concurrency theorems for non-linear rewriting theories ⋮ A generalized concurrent rule construction for double-pushout rewriting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallelism and concurrency of graph manipulations
• Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems
• Amalgamation of graph transformations: a synchronization mechanism
• Graph-based specification of access control policies
• Fundamentals of algebraic graph transformation
• Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation
• Adhesivity Is Not Enough: Local Church-Rosser Revisited
• Weakest Preconditions for High-Level Programs
• Correctness of high-level transformation systems relative to nested conditions
• Parallelism and concurrency in high-level replacement systems
• On grammars with local and global context conditions
• Hereditary Pushouts Reconsidered
• Adhesive and quasiadhesive categories
• Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars
• An axiomatic basis for computer programming

This page was built for publication: -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation