Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
Fundamenta Informaticae - Special issue on graph transformations
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Variations on mobile processes
Theoretical Computer Science
Theoretical Computer Science
Communication and Concurrency
Normal forms for algebras of connections
Theoretical Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Modelling Calculi with Name Mobility using Graphs with Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
A Category of Explicit Fusions
Concurrency, Graphs and Models
Synthesising CCS bisimulation using graph rewriting
Information and Computation
Concurrent rewriting for graphs with equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
Hi-index | 0.00 |
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, Müller 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.