Resolving non-determinism in choreographies
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 on...
Guardado en:
Publicado: |
2014
|
---|---|
Materias: | |
Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8410LNCS_n_p493_Bocchi http://hdl.handle.net/20.500.12110/paper_03029743_v8410LNCS_n_p493_Bocchi |
Aporte de: |
id |
paper:paper_03029743_v8410LNCS_n_p493_Bocchi |
---|---|
record_format |
dspace |
spelling |
paper:paper_03029743_v8410LNCS_n_p493_Bocchi2023-06-08T15:28:53Z Resolving non-determinism in choreographies Computer science Computers Non-determinism Realisability Artificial intelligence 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. 2014 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8410LNCS_n_p493_Bocchi http://hdl.handle.net/20.500.12110/paper_03029743_v8410LNCS_n_p493_Bocchi |
institution |
Universidad de Buenos Aires |
institution_str |
I-28 |
repository_str |
R-134 |
collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
topic |
Computer science Computers Non-determinism Realisability Artificial intelligence |
spellingShingle |
Computer science Computers Non-determinism Realisability Artificial intelligence Resolving non-determinism in choreographies |
topic_facet |
Computer science Computers Non-determinism Realisability Artificial intelligence |
description |
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. |
title |
Resolving non-determinism in choreographies |
title_short |
Resolving non-determinism in choreographies |
title_full |
Resolving non-determinism in choreographies |
title_fullStr |
Resolving non-determinism in choreographies |
title_full_unstemmed |
Resolving non-determinism in choreographies |
title_sort |
resolving non-determinism in choreographies |
publishDate |
2014 |
url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v8410LNCS_n_p493_Bocchi http://hdl.handle.net/20.500.12110/paper_03029743_v8410LNCS_n_p493_Bocchi |
_version_ |
1768543515069906944 |