On modelling mobility

DOI10.1016/S0304-3975(99)00230-3zbMath0954.68072MaRDI QIDQ1575151

Roberto M. Amadio

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

calculusbisimulationmobilitylocalities

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Basic observables for a calculus for global computing ⋮ A taxonomy of process calculi for distribution and mobility ⋮ A Distributed π-Calculus with Local Areas of Communication ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ Names of the \(\pi\)-calculus agents handled locally ⋮ What is a ``good encoding of guarded choice?

Uses Software

• Oz
• Erlang

Cites Work

• A calculus of mobile processes. II
• On the expressiveness of internal mobility in name-passing calculi
• On bisimulations for the asynchronous \(\pi\)-calculus
• Plain CHOCS. A second generation calculus for higher order processes
• Mobile ambients
• The name discipline of uniform receptiveness
• Renaming in an asynchronous environment
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• From a concurrent λ-calculus to the π-calculus
• A calculus of mobile agents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On modelling mobility