Pages that link to "Item:Q3625675"
From MaRDI portal
The following pages link to Correctness of high-level transformation systems relative to nested conditions (Q3625675):
Displaying 19 items.
- A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java (Q5100741) (← links)
- An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (Q5403460) (← links)
- Finitary -adhesive categories (Q5740372) (← links)
- Multi-amalgamation of rules with application conditions in -adhesive categories (Q5740374) (← links)
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation (Q5740375) (← links)
- Formal analysis of model transformations based on triple graph grammars (Q5740377) (← links)
- Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions (Q5740378) (← links)
- Correctness of Context-Moving Transformations for Term Rewriting Systems (Q5743602) (← links)
- Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic (Q6151620) (← links)
- Evaluation diversity for graph conditions (Q6156934) (← links)
- (Q6198042) (← links)
- A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity (Q6199404) (← links)
- Decidability of Resilience for Well-Structured Graph Transformation Systems (Q6487305) (← links)
- Probabilistic Metric Temporal Graph Logic (Q6487306) (← links)
- Finding the right way to Rome: effect-oriented graph transformation (Q6535506) (← links)
- A rule-based procedure for graph query solving (Q6535512) (← links)
- Compositional analysis of probabilistic timed graph transformation systems (Q6611954) (← links)
- A logical approach to graph databases (Q6615562) (← links)
- Resilience of well-structured graph transformation systems (Q6649537) (← links)