-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
From MaRDI portal
Publication:5740375
Recommendations
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- \(\mathcal M, \mathcal N\)-adhesive transformation systems
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- A general attribution concept for models in \({\mathcal M}\)-adhesive transformation systems
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- Transformations and confluence for rewrite systems
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
Cites work
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3582349 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Adhesive and quasiadhesive categories
- Adhesivity is not enough: local Church-Rosser revisited
- Amalgamation of graph transformations: a synchronization mechanism
- An axiomatic basis for computer programming
- Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems
- Correctness of high-level transformation systems relative to nested conditions
- Fundamentals of algebraic graph transformation
- Graph-based specification of access control policies
- Hereditary pushouts reconsidered
- On grammars with local and global context conditions
- Parallel independence of amalgamated graph transformations applied to model transformation
- Parallelism and concurrency in high-level replacement systems
- Parallelism and concurrency of graph manipulations
- Translation of restricted OCL constraints into graph constraints for generating meta model instances by graph grammars
- Weakest Preconditions for High-Level Programs
Cited in
(32)- A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Concurrency theorems for non-linear rewriting theories
- Evaluation diversity for graph conditions
- Inductive invariant checking with partial negative application conditions
- A generalized concurrent rule construction for double-pushout rewriting
- Constructing optimized constraint-preserving application conditions for model transformation rules
- Initial conflicts for transformation rules with nested application conditions
- scientific article; zbMATH DE number 7453087 (Why is no real title available?)
- scientific article; zbMATH DE number 7453970 (Why is no real title available?)
- \(\mathcal M, \mathcal N\)-adhesive transformation systems
- Conditional reactive systems
- Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions
- Variability-based model transformation: formal foundation and application
- Formal verification of invariants for attributed graph transformation systems based on nested attributed graph conditions
- Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction
- Finding the right way to Rome: effect-oriented graph transformation
- Multi-amalgamation of rules with application conditions in \(\mathcal{M}\)-adhesive categories
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Multi-amalgamation in adhesive categories
- Reconfigurable Petri nets with transition priorities and inhibitor arcs
- Rule algebras for adhesive categories
- Formal Methods in Software and Systems Modeling
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- scientific article; zbMATH DE number 7456048 (Why is no real title available?)
- scientific article; zbMATH DE number 7456054 (Why is no real title available?)
- Adhesivity is not enough: local Church-Rosser revisited
- scientific article; zbMATH DE number 7456060 (Why is no real title available?)
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
This page was built for publication: -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740375)
