2020/09/17 by Ugo de'Liguoro, Hernán Melgratti, Emilio Tuosto
Computer Science · #cs.LO #cs.SE
paper · pdf · doi:10.4204/eptcs.324.6
published as EPTCS 324, 2020, pp. 61-77 · In Proceedings ICE 2020, arXiv:2009.07628
arxiv created 2020/09/17 · arxiv updated 2020/09/18
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.