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
Theoretical Computer Science
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
Graph processes with fusions: concurrency by colimits, again
Formal Methods in Software and Systems Modeling
Concurrent rewriting for graphs with equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Ugo Montanari and Concurrency Theory
Concurrency, Graphs and Models
A truly concurrent semantics for the K framework based on graph transformations
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.00 |
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for modelling purposes, but, at the same time, problematic for the development of a satisfactory partial order concurrent semantics for rewrites. Rewriting over graphs with equivalences, i.e., (typed hyper)-graphs equipped with an equivalence over nodes provides a technically convenient replacement of graph rewriting with coalescing rules, for which a truly concurrent semantics can be easily defined. The expressivity of such a formalism is tested in a setting where coalescing rules typically play a basic role: the encoding of calculi with name passing as graph rewriting systems. Specifically, we show how the (monadic fragment) of the solo calculus, one of the dialect of those calculi whose distinctive feature is name fusion, can be encoded as a rewriting system over graph with equivalences.