Ordinal processes in comparative concurrency semantics

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

When comparing concurrency semantics, one of the main difficulties is to find counter-examples to show that two equivalences do not coincide, which takes on considerable proportions if these equivalences coincide in the framework of finitely branching programs. The study of Ordinal Processes of Klop provides us with a wide family of simple counter-examples. The considered semantics are induced by temporal logics CTL, CTL* and Lµ. We pursue this approach by, in addition, considering CCS-like contexts built up from the lyft operators of Groote and Vaandrager.

Cite

CITATION STYLE

APA

Pinchinat, S. (1992). Ordinal processes in comparative concurrency semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 626 LNCS, pp. 293–305). Springer Verlag. https://doi.org/10.1007/bfb0023775

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