Confluence up to garbage in graph transformation
From MaRDI portal
Publication:2049983
DOI10.1016/J.TCS.2021.06.010OpenAlexW3166223577MaRDI QIDQ2049983FDOQ2049983
Authors: Graham Campbell, Detlef Plump
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
Recommendations
Cites Work
- The algorithm design manual
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Title not available (Why is that?)
- On theories with a combinatorial definition of 'equivalence'
- Title not available (Why is that?)
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Topology of series-parallel networks
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Sequencing with Series-Parallel Precedence Constraints
- Fundamentals of algebraic graph transformation
- Efficient conflict detection in graph transformation systems by essential critical pairs
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Double-pushout graph transformation revisited
- Structured gamma
- Title not available (Why is that?)
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- Reasoning about graph programs
- Title not available (Why is that?)
- Confluence modulo equivalence with invariants in constraint handling rules
- Initial conflicts and dependencies: critical pairs revisited
- \(\mathcal M, \mathcal N\)-adhesive transformation systems
- Exploring conflict reasons for graph transformation systems
- Specifying graph languages with type graphs
- Confluence up to garbage
Cited In (3)
Uses Software
This page was built for publication: Confluence up to garbage in graph transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049983)