Parallel independence in attributed graph rewriting

MaRDI QIDQ5021233zbMATH OpenFDO

Authors Thierry Boy de la Tour

Publication date 12 January 2022

Full work available at URL https://arxiv.org/abs/2102.02366, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TERMGRAPH2020.5

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Parallel rewriting of attributed graphs
• Parallelism in single-pushout graph rewriting
• Parallel Graph Rewriting with Overlapping Rules
• Graph Transformations
• On the essence of parallel independence for the double-pushout and sesqui-pushout approaches

Cites work

• scientific article; zbMATH DE number 3548465 (Why is no real title available?)
• scientific article; zbMATH DE number 1088036 (Why is no real title available?)
• scientific article; zbMATH DE number 919844 (Why is no real title available?)
• Efficient conflict detection in graph transformation systems by essential critical pairs
• Fundamentals of algebraic graph transformation
• Graph Transformations
• On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
• Parallel rewriting of attributed graphs
• Synchronization algebras with mobility for graph transformations
• Verigraph: a system for specification and analysis of graph grammars

Cited in

(1)

• Parallel Graph Rewriting with Overlapping Rules

This page was built for publication: Parallel independence in attributed graph rewriting

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