A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
An abstract machine for concurrent modular systems: CHARM
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Towards an active network architecture
ACM SIGCOMM Computer Communication Review
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Resource access control in systems of mobile agents
Information and Computation
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Basic observables for a calculus for global computing
Information and Computation
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
A theory of system behaviour in the presence of node and link failure
Information and Computation
Concurrent and Located Synchronizations in π-Calculus
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Category of Explicit Fusions
Concurrency, Graphs and Models
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Families of Symmetries as Efficient Models of Resource Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
| Hi-index | 0.00 |
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 [Openflow foundation website, http://www.openflow.org/], where programs are allowed to manipulate the infrastructure. In this paper we present a network conscious, proper extension of the @p-calculus: we add connector names and the primitives to handle them, and we provide a concurrent semantics. The extension to connector names is natural and seamless, since they are handled in full analogy with ordinary names. Our observations are multisets of routing paths through which sent and received data are transported. However, restricted connector names do not appear in the observations, which thus can possibly be as abstract as in the @p-calculus. Finally, we show that bisimilarity is a congruence, and this property holds also for the concurrent version of the @p-calculus.