Learn More
Honda and Yoshida showed how to obtain a meaningful equivalence on processes in the asynchronous-calculus using equational theories identifying insensitive processes. We apply their approach to a dialect of Cardelli and Gordon's Mobile Ambients. The version we propose here is the Push and Pull Ambient Calculus, where the operational semantics is no longer(More)
Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We present the stochastic version of Mobile Ambients, called Stochastic Mobile Ambients (SMA), where we extend MA with time and probabilities. Inspired by previous models, PEPA and Sπ, we(More)
We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixed choice, separate choice and internal mobility, value-passing CCS and Mobile Ambients, together with other ambient calculi (Safe Ambients, the Push and Pull Ambient Calculus and Boxed(More)
Palamidessi has shown that the π-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi's methods, we deduce that there is no encoding satisfying certain(More)
We study the π-calculus, enriched with pairing and non-blocking input , and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen's calculus(More)
We define a new, output-based encoding of the λ-calculus into the asynchronous π-calculus – enriched with pairing – that has its origin in mathematical logic, and show that this encoding respects one-step spine-reduction up to substitution, and that normal substitution is respected up to similarity. We will also show that it fully encodes lazy reduction of(More)
In this paper we provide a general method to derive product-form solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem and we provide a different formulation using labeled automata, a generalization which encompasses a bigger class of product-form solutions, and a new proof based on the solution of the system of(More)