From Global Choreography to Efficient Distributed Implementation

Abstract

We define a methodology to automatically synthesize efficient distributed implementation starting from highlevel global choreography. A global choreography describes the communication logic between the interfaces of a set of predefined processes. The operations provided by the choreography (e.g., multiparty, choice, loop, branching) are master-triggered and conflict-free by construction (no conflict parallel interleaving), which permits the generation of fully distributed implementations (i.e., no need for controllers). We apply our methodology by automatically synthesizing micro-services architectures.