Abstract:

We define a construction operation on hypergraphs using a co-limit and show that its expressiveness concerning graph rewriting is equal to the graph expressions of Courcelle and the double-pushout approach of Ehrig. With an inductive way of representing graphs, graph rewriting arises naturally as a derived concept. The usefulness of our approach for the compositional modelling of concurrent systems is then shown by defining the semantics of a process calculus with mobility and of petri nets.