Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions

DOI10.1016/j.entcs.2008.10.042zbMath1277.68194OpenAlexW2090354977MaRDI QIDQ2864377

Ulrike Prange, Fernando Orejas, Hartmut Ehrig, Leen Lambers

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.10.042

zbMATH Keywords

parallelismconcurrencynegative application conditionsadhesive high-level replacement categories

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Transformations in Reconfigurable Place/Transition Systems ⋮ Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs ⋮ Embedding and Confluence of Graph Transformations with Negative Application Conditions ⋮ High-Level Programs and Program Conditions ⋮ Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions ⋮ A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars

Cites Work

• Unnamed Item
• Graph-based specification of access control policies
• Fundamentals of algebraic graph transformation
• Conflict Detection for Graph Transformation with Negative Application Conditions
• Adhesive and quasiadhesive categories

This page was built for publication: Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions