A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
From MaRDI portal
Publication:2096426
DOI10.1016/j.jlamp.2022.100820OpenAlexW4297013811WikidataQ115188992 ScholiaQ115188992MaRDI QIDQ2096426
Gabriele Taentzer, Jens Kosiol
Publication date: 16 November 2022
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2022.100820
graph transformationdouble-pushout rewriting\(\mathcal{M}\)-adhesive categoriesconcurrency theoremmodel editing
Related Items (1)
Cites Work
- Algebraic approach to single-pushout graph transformation
- Parallelism and concurrency of graph manipulations
- Concurrency theorems for non-linear rewriting theories
- A generalized concurrent rule construction for double-pushout rewriting
- Fundamentals of algebraic graph transformation
- Fundamental approaches to software engineering. 22nd international conference, FASE 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings
- Graph and model transformation. General framework and applications
- Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions
- Adhesivity with Partial Maps instead of Spans
- Polymorphic Sesqui-Pushout Graph Rewriting
- Rule Algebras for Adhesive Categories
- Sesqui-Pushout Rewriting
- Quasitoposes, Quasiadhesive Categories and Artin Glueing
- Correctness of high-level transformation systems relative to nested conditions
- Parallelism and concurrency in high-level replacement systems
- Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics
- Adhesive and quasiadhesive categories
- Processes and unfoldings: concurrent computations in adhesive categories
- Multi-amalgamation of rules with application conditions in -adhesive categories
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications