A generalized concurrent rule construction for double-pushout rewriting
From MaRDI portal
Publication:2117256
Abstract: Double-pushout rewriting is an established categorical approach to the rule-based transformation of graphs and graph-like objects. One of its standard results is the construction of concurrent rules and the Concurrency Theorem pertaining to it: The sequential application of two rules can equivalently be replaced by the application of a concurrent rule and vice versa. We extend and generalize this result by introducing generalized concurrent rules (GCRs). Their distinguishing property is that they allow identifying and preserving elements that are deleted by their first underlying rule and created by the second one. We position this new kind of composition of rules among the existing ones and obtain a Generalized Concurrency Theorem for it. We conduct our work in the same generic framework in which the Concurrency Theorem has been presented, namely double-pushout rewriting in M-adhesive categories via rules equipped with application conditions.
Recommendations
Cites work
- scientific article; zbMATH DE number 7226005 (Why is no real title available?)
- scientific article; zbMATH DE number 5606347 (Why is no real title available?)
- scientific article; zbMATH DE number 3907796 (Why is no real title available?)
- scientific article; zbMATH DE number 1929900 (Why is no real title available?)
- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Adhesive and quasiadhesive categories
- Adhesive subcategories of functor categories with instantiation to partial triple graphs
- Algebraic approach to single-pushout graph transformation
- Correctness of high-level transformation systems relative to nested conditions
- Double-pushout rewriting in context: rule composition and parallel independence
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Fundamentals of algebraic graph transformation
- Graph and model transformation. General framework and applications
- Local Confluence for Rules with Nested Application Conditions
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- Multilevel typed graph transformations
- Parallelism and concurrency in high-level replacement systems
- Parallelism and concurrency of graph manipulations
- Polymorphic sesqui-pushout graph rewriting
- Rule algebras for adhesive categories
Cited in
(13)- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- Concurrency theorems for non-linear rewriting theories
- Double-pushout rewriting in context: rule composition and parallel independence
- Rewriting abstract structures: materialization explained categorically
- Formal Methods in Software and Systems Modeling
- Van Kampen squares for graph transformation
- Compositionality of rewriting rules with conditions
- Reversible sesqui-pushout rewriting
- Rule algebras for adhesive categories
- Adhesive DPO parallelism for monic matches
- Polymorphic sesqui-pushout graph rewriting
- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
This page was built for publication: A generalized concurrent rule construction for double-pushout rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117256)
