The contractum in algebraic graph rewriting

DOI10.1007/3-540-61228-9_76MaRDI QIDQ4645265zbMATH OpenOpenAlexFDO

Authors Richard Banach

Publication date 10 January 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61228-9_76

zbMATH Keywords

algebraic approachgraph transformationgraph grammargarbage collectionsafety property

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 517053
• On graph rewritings
• scientific article; zbMATH DE number 3878382
• Theoretical Computer Science
• Contractors and connectors of graph algebras
• Algebraic graph rewriting with controlled embedding
• scientific article; zbMATH DE number 4049097
• A Rewriting Approach to Graph Invariants
• Graph expressions and graph rewritings
• scientific article; zbMATH DE number 234035

Cites work

• scientific article; zbMATH DE number 4049095 (Why is no real title available?)
• scientific article; zbMATH DE number 4080885 (Why is no real title available?)
• scientific article; zbMATH DE number 177439 (Why is no real title available?)
• scientific article; zbMATH DE number 3633737 (Why is no real title available?)
• scientific article; zbMATH DE number 234035 (Why is no real title available?)
• Canonical derivations for high-level replacement systems
• Locating the contractum in the double pushout approach
• Parallelism and concurrency in high-level replacement systems
• Pushout-Properties: An analysis of gluing constructions for graphs
• Term graph rewriting and garbage collection using opfibrations

Cited in

(1)

• Locating the contractum in the double pushout approach

This page was built for publication: The contractum in algebraic graph rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645265)