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.
Cite
CITATION STYLE
Bocchi, L., Melgratti, H., & Tuosto, E. (2014). Resolving non-determinism in choreographies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8410 LNCS, pp. 493–512). Springer Verlag. https://doi.org/10.1007/978-3-642-54833-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
