Results 1 
8 of
8
Electoral systems in ambient calculi
 In Proceedings of 7th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2004
, 2004
"... Abstract. This paper compares the expressiveness of ambient calculi against different dialects of the picalculus. Cardelli and Gordon encoded the asynchronous picalculus into their calculus of Mobile Ambients (MA). Zimmer has shown that the synchronous picalculus without choice can be encoded in ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
(Show Context)
Abstract. This paper compares the expressiveness of ambient calculi against different dialects of the picalculus. Cardelli and Gordon encoded the asynchronous picalculus into their calculus of Mobile Ambients (MA). Zimmer has shown that the synchronous picalculus without choice can be encoded in pure (no communication) Safe Ambients. We show that pure MA without restriction has symmetric electoral systems, that is, it is possible to solve the problem of electing a leader in a symmetric network. By the work of Palamidessi, this implies that pure MA without restriction is not encodable (under certain conditions) in the picalculus with separate choice. We adapt the work of Carbone and Maffeis to show that pure MA cannot be encoded (under certain other conditions) into the picalculus with mixed choice (but without matching). 1
Stochastic Ambient Calculus
 QAPL 2006
, 2006
"... 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 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
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 enhance the prefix of the capabilities with a rate and the ambient with a linear function that operates on the rates of processes executing inside it. The linear functions associated with ambients represent the delays that govern particular administrative domains. We derive performance measures from the labelled transition semantics as in standard models. We also define a strong Markov bisimulation in the style of reduction semantics known as barbed bisimulation. We argue that performance measures are of vital importance in designing any kind of distributed system, and that SMA can be useful in the design of the complicated mobile systems.
A coalgebraic approach to the semantics of the ambient calculus
 ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE
, 2005
"... Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example is the ambient calculus. Due to the complexity of the involved spatial reduction, there is — in contrast to the situatio ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example is the ambient calculus. Due to the complexity of the involved spatial reduction, there is — in contrast to the situation in standard process algebra — up to now no satisfying coalgebraic representation of a mobile process calculus. Here, we discuss a coalgebraic denotational semantics for the ambient calculus, viewed as a step towards a generic coalgebraic framework for modelling mobile systems. Crucial features of our modelling are a set of GSOS style transition rules for the ambient calculus, a hardwiring of the socalled hardening relation in the functorial signature, and a setbased treatment of hidden name sharing. The formal representation of this framework is cast in the algebraiccoalgebraic specification language CoCasl.
Symmetric electoral systems for ambient calculi
 Information & Computation. Accepted
"... This paper compares the expressiveness of different fragments of ambient calculi via ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
This paper compares the expressiveness of different fragments of ambient calculi via
Abstract Leader Election in Rings of Ambient Processes 1
"... 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 method ..."
Abstract
 Add to MetaCart
(Show Context)
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 conditions from MA into CCS. We also show that the calculus of Boxed Ambients is more expressive than its communicationfree fragment.
calculi via leader election problems
"... Tutorial on separation results in process ..."
(Show Context)
Towards a Coalgebraic Semantics of the Ambient Calculus
"... the classical process calculus CCS, a coalgebraic semantics has been defined in [10]; further work in similar directions is found e.g. in [6, 7]. Here, we present work leading towards a coalgebraic denotational semantics for mobile process calculi, in particular the ambient calculus [4]. This poses ..."
Abstract
 Add to MetaCart
(Show Context)
the classical process calculus CCS, a coalgebraic semantics has been defined in [10]; further work in similar directions is found e.g. in [6, 7]. Here, we present work leading towards a coalgebraic denotational semantics for mobile process calculi, in particular the ambient calculus [4]. This poses rather more involved problems than in the case of classical calculi, since the spatial structure interacts with the dynamic structure of processes in a complex way.
EXPRESS 2004 Final Version Leader Election in Rings of Ambient Processes Abstract
"... 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 method ..."
Abstract
 Add to MetaCart
(Show Context)
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 conditions from MA into CCS. We also show that the calculus of Boxed Ambients is more expressive than its communicationfree fragment.