Graph processes with fusions: Concurrency by colimits, again

DOI10.1007/978-3-540-31847-7_5MaRDI QIDQ5710425zbMATH OpenOpenAlexFDO

Authors Fabio Gadducci, Ugo Montanari

Publication date 2 December 2005

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

Full work available at URL https://doi.org/10.1007/b106390

zbMATH Keywords

concurrent semanticsDPO rewritingprocess calculi

Mathematics Subject Classification ID

Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Categorical semantics of formal languages (18C50) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 919845
• Concurrent Rewriting for Graphs with Equivalences
• A calculus of concurrent graph-rewriting processes
• scientific article; zbMATH DE number 1497812
• A generalized concurrent rule construction for double-pushout rewriting

Cited in

(3)

• Synthesising CCS bisimulation using graph rewriting
• Modelling calculi with name mobility using graphs with equivalences
• A Category of Explicit Fusions

Describes a project that uses

Uses Software

• PLUMP

This page was built for publication: Graph processes with fusions: Concurrency by colimits, again

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