Reduction Semantics for Ambient Calculi (2004)

by Maria Grazia Vigliotti
Venue:Trans In) (Trans Cap) P ≻ (ν−→ p )〈M.P ′ 〉P ′′ P M −→CG (ν −→ p )(P ′ |P ′′ ) (fn(M) ∩ −→ p = ∅) (Trans Amb) P
Citations:8 - 5 self

Documents Related by Co-Citation

13 On Reduction Semantics for the Push and Pull Ambient Calculus – Iain Phillips, Maria Grazia Vigliotti - 2002
13 On the Expressiveness of Pure Safe Ambients – Pascal Zimmer - 2002
160 Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculi – Catuscia Palamidessi - 2002
31 On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes – L Bougé - 1988
203 Local and global properties in networks of processors – D Angluin - 1980
814 Mobile ambients – Luca Cardelli, Andrew D. Gordon - 1998
592 A Communicating and Mobile Systems: the π-Calculus – R Milner - 1999
50 Access Control for Mobile Agents: the Calculus of Boxed Ambients – M Bugliesi, G Castagna, S Crafa
31 D.: Mobile safe ambients – F Levi, Sangiorgi - 2003
15 Leader election in rings of ambient processes – I C C Phillips, M G Vigliotti - 1996
3219 Communication and Concurrency – R Milner - 1990
54 Bisimulation Congruences in Safe Ambients – Massimo Merro, Matthew Hennessy - 2001
15 Making Ambients More Robust – Xudong Guan, Yiling Yang, Jinyuan You - 2000
19 On the computational strength of pure ambient calculi – Sergio Maffeis, Iain Phillips - 2005
18 Electoral systems in ambient calculi – Iain Phillips, Maria Grazia Vigliotti - 2004
224 Barbed Bisimulation – Robin Milner, Davide Sangiorgi, Edinburgh Eh Jz - 1992
80 Boxed ambients – Michele Bugliesi, Silvia Crafa - 2001
45 Asynchrony and the π-calculus – G Boudol - 1992
363 An Object Calculus for Asynchronous Communication – Kohei Honda, Mario Tokoro - 1991