arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.08337cs.SEcs.LO
收藏

关于解决编排中非确定性的研究

On Resolving Non-determinism in Choreographies

Laura Bocchi, Hernan Melgratti, Emilio Tuosto

AI总结:

本文提出全谱实现概念,解决编排中非确定性选择与确定性实现的对应关系,并给出类型规则检查方法,以POP协议为案例验证。

摘要:

编排通过消息传递来指定多方交互。编排的实现是独立进程的组合,这些进程的行为符合编排的规范。现有的编排与实现之间的正确性/完备性关系基于选择为非确定性的模型。将非确定性选择解析为确定性选择(例如条件语句)对于正确刻画编排与其具体编程语言实现之间的关系是必要的。我们引入了一种编排的可实现性概念——称为全谱实现——其中编排中的选择仍然是非确定性的,但在其实现中是确定性的。我们的全谱实现概念排除了角色的确定性实现,这些实现无论置于何种上下文中,都永远不会遵循非确定性选择的一个分支。我们给出了一种用于检查全谱实现的类型规则。作为案例研究,我们在全谱实现的视角下分析了POP协议。

英文摘要:

Choreographies specify multiparty interactions via message passing. A realisation of a choreography is a composition of independent processes that behave as specified by the choreography. Existing relations of correctness/completeness between choreographies and realisations are based on models where choices are non-deterministic. Resolving non-deterministic choices into deterministic choices (e.g., conditional statements) is necessary to correctly characterise the relationship between choreographies and their implementations with concrete programming languages. We introduce a notion of realisability for choreographies - called whole-spectrum implementation - where choices are still non-deterministic in choreographies, but are deterministic in their implementations. Our notion of whole spectrum implementation 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 give a type discipline for checking whole-spectrum implementations. As a case study, we analyse the POP protocol under the lens of whole-spectrum implementation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑