From CCS to CSP: the m-among-n Synchronisation Approach

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Open Publishing Association

Access

openAccess

Embargo end date

Citation

Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield, From CCS to CSP: the m-among-n Synchronisation Approach, Electronic Proceedings in Theoretical Computer Science, Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, Warsaw, Poland, 12th September 2022, Valentina Castiglioni, Claudio Antares., Open Publishing Association, 2022, 60 - 74

Abstract

We present an alternative translation from CCS to an extension of CSP based on m-among-n syn chronisation (called CSPmn). This translation is correct up to strong bisimulation. Unlike the g-star renaming approach ([4]), this translation is not limited by replication (viz., recursion with no nested parallel composition). We show that m-among-n synchronisation can be implemented in CSP based on multiway synchronisation and renaming.

Description

Endorsement

Review

Supplemented By

Referenced By

Keywords

Sponsor: Marie Curie
Grant Number: 754489

Sponsor: Science Foundation Ireland (SFI)
Grant Number: 13/RC/2094

Other Titles: Electronic Proceedings in Theoretical Computer Science
Publisher: Open Publishing Association
Type of material: Conference Paper