Skip to main content
Conference Proceedings

Permutation of transitions: An event structure semantics for CCS and SCCS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1989) 354 LNCS 411-427
DOI: 10.1007/BFb0013028
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We apply Berry & Lévy's notion of equivalence by permutations to CCS and Meije/SCCS, thus obtaining a pomset transition semantics for these calculi. We show that this provides an operational counterpart for an event structure semantics for CCS and SCCS similar to the one given by Winskel.

Author supplied keywords

Cite

CITATION STYLE

APA

Boudol, G., & Castellani, I. (1989). Permutation of transitions: An event structure semantics for CCS and SCCS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 354 LNCS, pp. 411–427). Springer Verlag. https://doi.org/10.1007/BFb0013028

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free