A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
From MaRDI portal
Publication:2096426
Recommendations
Cites work
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- A generalized concurrent rule construction for double-pushout rewriting
- Adhesive and quasiadhesive categories
- Adhesivity with partial maps instead of spans
- Algebraic approach to single-pushout graph transformation
- Categorical frameworks for graph transformation and HLR systems based on the DPO approach
- Combinatorial conversion and moment bisimulation for stochastic rewriting systems
- Concurrency theorems for non-linear rewriting theories
- Correctness of high-level transformation systems relative to nested conditions
- 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
- Fundamentals of algebraic graph transformation
- Graph and model transformation. General framework and applications
- scientific article; zbMATH DE number 3907796 (Why is no real title available?)
- scientific article; zbMATH DE number 4049016 (Why is no real title available?)
- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Parallelism and concurrency in high-level replacement systems
- Parallelism and concurrency of graph manipulations
- Polymorphic sesqui-pushout graph rewriting
- Processes and unfoldings: concurrent computations in adhesive categories
- Quasitoposes, Quasiadhesive Categories and Artin Glueing
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Rule algebras for adhesive categories
- Sesqui-Pushout Rewriting
Cited in
(4)- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- Specification and modelling of computing systems through graphs and graph transformation
- Advanced consistency restoration with higher-order short-cut rules
- Advanced model consistency restoration with higher-order short-cut rules
This page was built for publication: A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096426)