In: Guessarian, I.: Lecture Notes in Computer Science, Vol. 469; Semantics of Systems of Concurrent Processes. Proceedings of the LITP Spring School on Theoretical Computer Science, 1990, La Roche Posay, France, pages 96-141. Berlin, Germany: Springer-Verlag, 1990.
Abstract: The aim of this paper is to contribute to the area of ``comparative non-interleaving semantics'' for algebraic languages, by establishing the equivalence of three operational models for finite CCS. The three interpretations can be summarized as follows: (1) a semantics by permutations of concurrent transitions, (2) a semantics by means of flow event structures, (3) a semantics by means of flow nets. The authors present a proved transition system semantics for finite CCS; the permutation semantics is considered, and the diamond property for concurrent transitions is given. Finally, the various semantics are brought together, and it is shown how they relate to each other.
Keywords: semantics equivalence (for) CCS; comparative non-interleaving semantics (for) algebraic language; operational model (for) finite CCS; flow event structure; flow net; permutations (of) concurrent transition(s); transition system semantics; permutation semantics; diamond property.