Confluence up to garbage in graph transformation
From MaRDI portal
Publication:2049983
DOI10.1016/j.tcs.2021.06.010OpenAlexW3166223577MaRDI QIDQ2049983
Publication date: 27 August 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.01842
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Confluence modulo equivalence with invariants in constraint handling rules
- Initial conflicts and dependencies: critical pairs revisited
- Structured gamma
- Exploring conflict reasons for graph transformation systems
- Topology of series-parallel networks
- Specifying graph languages with type graphs
- Fundamentals of algebraic graph transformation
- On theories with a combinatorial definition of 'equivalence'
- Double-pushout graph transformation revisited
- ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence
- $\mathcal M, \mathcal N$ -Adhesive Transformation Systems
- Sequencing with Series-Parallel Precedence Constraints
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Confluence up to Garbage
- Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Confluence up to garbage in graph transformation