Please use this identifier to cite or link to this item:
Title: Resolving non-determinism in choreographies
Authors: Bocchi, L.
Melgratti, H.
Tuosto, Emilio
First Published: 2014
Presented at: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014
Start Date: 5-Apr-2014
End Date: 13-Apr-2014
Publisher: Springer Verlag (Germany)
Citation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8410 LNCS, pp. 493-512
Abstract: 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. © 2014 Springer-Verlag.
DOI Link: 10.1007/978-3-642-54833-8_26
ISSN: 0302-9743
eISSN: 1611-3349
Version: Post-print
Status: Peer-reviewed
Type: Journal Article
Rights: Archived with reference to SHERPA/RoMEO and publisher website. The final publication is available at Springer via
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
main.pdfPost-review (final submitted)342.6 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.