Skip to main content
Kent Academic Repository

Resolving Non-Determinism in Choreographies

Bocchi, Laura, Melgratti, Hernán, Tuosto, Emilio (2014) Resolving Non-Determinism in Choreographies. In: Programming Languages and Systems: European Symposium on Programming (ESOP). European Symposium on Programming (ESOP). Lecture Notes in Computer Science . pp. 493-512. Springer, Berlin, Germany ISBN 978-3-642-54832-1. E-ISBN 978-3-642-54833-8. (doi:10.1007/978-3-642-54833-8_26) (KAR id:43733)


Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies –called whole-spectrum implementation– that rules out deterministic implementations of roles that, no matter which context they are placed in, will never follow one of the branches of a non-deterministic choice. We show that, under some conditions, it is decidable whether an implementation is whole-spectrum. As a case study, we analyse the POP protocol under the lens of whole-spectrum implementation.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1007/978-3-642-54833-8_26
Subjects: Q Science > QA Mathematics (inc Computing science) > QA299 Analysis, Calculus
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Laura Bocchi
Date Deposited: 05 Nov 2014 10:19 UTC
Last Modified: 10 Dec 2022 23:10 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.