Network Conscious pi-calculus

Montanari, Ugo and Sammartino, Matteo (2012) Network Conscious pi-calculus. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

Other (GZip) Available under License Creative Commons Attribution No Derivatives. Download (496Kb)

Abstract

Traditional process calculi usually abstract away from network details, modeling only communication over shared channels. They, however, seem inadequate to describe new network architectures, such as Software Defined Networks, where programs are allowed to manipulate the infrastructure. In this paper we present a network conscious, proper extension of the pi-calculus: we add connector names and the primitives to handle them, and we provide both an interleaving and a concurrent semantics. The extension to connector names is natural and seamless, since they are handled in full analogy with ordinary names. In the interleaving case, observations are the routing paths through which sent and received data are transported, while in the concurrent case we allow to observe multisets of paths. However, restricted connector names do not appear in the observations, which thus can possibly be as abstract as in the pi-calculus. Finally, for the concurrent semantics we show that bisimilarity is a congruence, and this property holds also for the concurrent version of the pi-calculus.

Repository staff only actions