2013/02/26 by Marco Carbone, Fabrizio Montesi
Computer Science · #cs.PL #cs.DC
paper · pdf · doi:10.4204/eptcs.109.4
published as EPTCS 109, 2013, pp. 21-27 · In Proceedings PLACES 2012, arXiv:1302.5798
arxiv created 2013/02/26 · arxiv updated 2013/02/27
Choreography-based programming is a powerful paradigm for defining communication-based systems from a global viewpoint. A choreography can be checked against multiparty protocol specifications, given as behavioural types, that may be instantiated indefinitely at runtime. Each protocol instance is started with a synchronisation among the involved peers. We analyse a simple transformation from a choreography with a possibly unbounded number of protocol instantiations to a choreography instantiating a single protocol, which is the merge of the original ones. This gives an effective methodology for obtaining new protocols by composing existing ones. Moreover, by removing all synchronisations required for starting protocol instances, our transformation reduces the number of communications and resources needed to execute a choreography.