An Asynchronous Model of Locality, Failure, and Process Mobility
Abstract
We present a model of distributed computation which is based on a fragment of the $\pi$-calculus relying on {\em asynchronous} communication. We enrich the model with the following features: the explicit distribution of processes to locations, the failure of locations and their detection, and the mobility of processes. Our contributions are two folds. At the specification level, we give a synthetic and flexible formalization of the features mentioned above. At the verification level, we provide original methods to reason about the bisimilarity of processes in the presence of failures.