A generalized concurrent rule construction for double-pushout rewriting
From MaRDI portal
Publication:2117256
DOI10.1007/978-3-030-78946-6_2zbMath1489.68116arXiv2105.02309OpenAlexW3176303242MaRDI QIDQ2117256
Gabriele Taentzer, Jens Kosiol
Publication date: 21 March 2022
Full work available at URL: https://arxiv.org/abs/2105.02309
graph transformationdouble-pushout rewritingconcurrency theoremmodel editing\( \mathcal{M} \)-adhesive categories
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic approach to single-pushout graph transformation
- Parallelism and concurrency of graph manipulations
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Double-pushout rewriting in context: rule composition and parallel independence
- Adhesive subcategories of functor categories with instantiation to partial triple graphs
- Fundamentals of algebraic graph transformation
- Graph and model transformation. General framework and applications
- Polymorphic Sesqui-Pushout Graph Rewriting
- Rule Algebras for Adhesive Categories
- Correctness of high-level transformation systems relative to nested conditions
- Parallelism and concurrency in high-level replacement systems
- Local Confluence for Rules with Nested Application Conditions
- Multilevel Typed Graph Transformations
- Adhesive and quasiadhesive categories
- Multi-amalgamation of rules with application conditions in -adhesive categories
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
This page was built for publication: A generalized concurrent rule construction for double-pushout rewriting
