We present a model of distributed computation which is based on a fragment of the π-calculus relying on 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.
CITATION STYLE
Amadio, R. M. (1997). An asynchronous model of locality, failure, and process mobility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1282, pp. 374–391). Springer Verlag. https://doi.org/10.1007/3-540-63383-9_92
Mendeley helps you to discover research relevant for your work.