Graph Processes with Fusions: Concurrency by Colimits, Again

Classical concurrency in the dpo approach to graph rewriting, as defined by the shift equivalence construction [7], can also be represented by a graph process, a structure where concurrency and causal dependency are synthetically represented by a partial ordering of rewrites [1]. Interestingly, all shift equivalent derivations, considered as diagrams in the category of graphs, have the same colimit, which moreover exactly corresponds to the graph process. This construction, due to Corradini, Montanari and Rossi, was originally defined for rules with injective right-hand morphisms [6]. This condition turns out to be restrictive when graphs are used for modeling process calculi like ambients [4] or fusion [21], where the coalescing of read-only items is essential [11,13]. Recently, a paper by Habel, Muller and Plump [16] considered again shift equivalence, extending classical results to non-injective rules. In this paper we look at the graph-process-via-colimit approach: We propose and motivate its extension to non-injective rules in terms of existing computational models, and compare it with the aforementioned results.