In: de Bakker, J.W.; et al.: Lecture Notes in Computer Science, Vol. 354: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency., pages 411-427. Springer Verlag, 1989.
Abstract: The authors apply Berry and Léviy's notion of equivalence by permutations to CCS and MEIJE/SCCS, thus obtaining a pomset transition semantics for these calculi. They show that this provides an operational counterpart for an event structure semantics for CCS and SCCS similar to the one given by Winskel.
Keywords: event structure; pomset-labelled transition; CCS; SCCS; equivalence (by) permutation.
Back to the Petri Nets Bibliography