Encoding Asynchrony in Choreographies

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


Choreographies are widely used both for the specification and the programming of concurrent and distributed software architectures. Since many of such architectures use asynchronous communications, it is essential to understand how the behaviour described in a choreography can be correctly implemented in asynchronous settings. So far, this problem has been addressed by relying on additional technical machinery, such as ad-hoc syntactic terms, semantics, or equivalences. In this work, we show that such extensions are not needed for choreography languages that support primitives for process spawning and name mobility. Instead, we can just encode asynchronous communications in choreographies themselves, yielding a simpler approach.
Original languageEnglish
Title of host publicationProceedings of the Symposium on Applied Computing
PublisherAssociation for Computing Machinery
Publication date2017
ISBN (Print)978-1-4503-4486-9
ISBN (Electronic)9781450344869
Publication statusPublished - 2017
EventACM Symposium on Applied Computing -
Duration: 3. Apr 20177. Apr 2017
Conference number: 2017


ConferenceACM Symposium on Applied Computing


  • Asynchrony
  • Choreography
  • Concurrency


Dive into the research topics of 'Encoding Asynchrony in Choreographies'. Together they form a unique fingerprint.

Cite this