Recommendations
- Confluence up to garbage in graph transformation
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Confluence for graph transformations
- M-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- Confluence of indirection reductions in graph rewrite systems
Cites work
- scientific article; zbMATH DE number 1638661 (Why is no real title available?)
- scientific article; zbMATH DE number 1183250 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3548465 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Double-pushout graph transformation revisited
- Efficient conflict detection in graph transformation systems by essential critical pairs
- Exploring conflict reasons for graph transformation systems
- Fundamentals of algebraic graph transformation
- Initial conflicts and dependencies: critical pairs revisited
- On theories with a combinatorial definition of 'equivalence'
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Reasoning about graph programs
- Relational and Kleene-Algebraic Methods in Computer Science
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Sequencing with Series-Parallel Precedence Constraints
- Structured gamma
- Term Rewriting and All That
- The monadic second-order logic of graphs : Definable sets of finite graphs
- Topology of series-parallel networks
Cited in
(3)
This page was built for publication: Confluence up to garbage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100723)
