Towards Refinable Choreographies
Logic in Computer Science
2020-09-18 v1 Software Engineering
Abstract
We investigate refinement in the context of choreographies. We introduce refinable global choreographies allowing for the underspecification of protocols, whose interactions can be refined into actual protocols. Arbitrary refinements may spoil well-formedness, that is the sufficient conditions that guarantee a protocol to be implementable. We introduce a typing discipline that enforces well-formedness of typed choreographies. Then we unveil the relation among refinable choregraphies and their admissible refinements in terms of an axiom scheme.
Cite
@article{arxiv.2009.07991,
title = {Towards Refinable Choreographies},
author = {Ugo de'Liguoro and Hernán Melgratti and Emilio Tuosto},
journal= {arXiv preprint arXiv:2009.07991},
year = {2020}
}
Comments
In Proceedings ICE 2020, arXiv:2009.07628