Abstract
ESM systems are a graph-rewriting formalism for concurrent systems: a global system state is represented by a graph and a run of the system is described by a graph rewriting process. These rewriting processes are formally described by computation structures. It is demonstrated that the computation structures of an ESM system P may be viewed as the arrows of a category Catcomp(P) where objects are system states. This category generalizes the well-known notion of a transition system. From Catcomp(P) various more abstract semantics are derived, and for each of them a powerful composition operation on computations, generalizing both the sequential and parallel composition of computations, is defined.
Get full access to this article
View all access options for this article.