Parallel and Sequential Independence for Borrowed Contexts

DOI10.1007/978-3-540-87405-8_16zbMATH Open1175.68216OpenAlexW1533317206MaRDI QIDQ3540401FDOQ3540401

Authors: Filippo Bonchi, Fabio Gadducci, Tobias Heindel 

Publication date: 20 November 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_16

Recommendations

• Double-pushout rewriting in context: rule composition and parallel independence
• Parallelism in single-pushout graph rewriting
• Adhesive DPO parallelism for monic matches
• On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• Parallelism in AGREE transformations
• Double-pushout rewriting in context: rule composition and parallel independence
• Algebraic graph rewriting with controlled embedding
• Adhesive DPO parallelism for monic matches
• Composition and Decomposition of DPO Transformations with Borrowed Context

This page was built for publication: Parallel and Sequential Independence for Borrowed Contexts

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