We give a divergence-free encoding of polyadic Local pi into its monadic variant. Local pi is a sub-calculus of asynchronous pi-calculus where the recipients of a channel are local to the process that has created the channel. We prove the encoding fully-abstract with respect to barbed congruence. This implies that in Local pi (i) polyadicity does not add extra expressive power, and (ii) when studying the theory of polyadic Local pi we can focus on the simpler monadic variant. Then, we show how the idea of our encoding can be adapted to name-passing calculi with non-binding input prefix, such as Chi , Fusion and piF calculi .
File in questo prodotto:
Non ci sono file associati a questo prodotto.