Is It a “Good” Encoding of Mixed Choice?

Mixed choice is a widely-used primitive in process calculi. It is interesting, as it allows to break symmetries in distributed process networks. We present an encoding of mixed choice in the context of the pi-calculus and investigate to what extent it can be considered “good”. As a crucial novelty, we introduce a suitable criterion to measure whether the degree of distribution in process networks is preserved.