Process Languages for ESM Systems
D. Janssens · Electronic Notes in Theoretical Computer Science · 1995
In most approaches to graph grammars the formal description of their behaviour is based on a derivation relation between graphs. Graph grammar processes may then be constructed from derivation sequences. However one may also follow an alternative approach, considering a graph grammar directly as the generator of a language of process objects, as was done in earlier work about ESM graph rewriting. In this paper the relation between the two approaches is clarified, using results about the composition and decomposition of ESM processes. It is shown that processes in the usual sense correspond to a special case of general ESM process objects. The use of these general process objects is illustrated by an application of ESM graph rewriting to the modeling of parallel object-oriented systems.