ABSTRACT SEMANTICS FOR ESM SYSTEMS

Article type: Research Article

Authors: Janssens, D. | Mens, T.

Affiliations: Department of Mathematics and Computer Science, University of Antwerp (UIA), Antwerp, Belgium | Department of Mathematics, Free University of Brussels (VUB), Brussels, Belgium

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.

DOI: 10.3233/FI-1996-263405

Journal: Fundamenta Informaticae, vol. 26, no. 3-4, pp. 315-339, 1996