(Enter summary)
Abstract: We present a model of distributed computation which is based on a fragment of the pi-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 ... (Update)
Context of citations to this paper: More
...of locations or localities [8] have tried to address them. For instance, Nomadic Pict [22] provides process mobility; the 1l calculus [1] and the distributed join calculus with failures [13] embody both process mobility and failure detection; other calculi, such as the D...
...of locations or localities [7] have tried to address them. For instance, Nomadic Pict [19] provides process mobility; the 1l calculus [1] and the distributed join calculus with failures [11] embody both process mobility and failure detection; other calculi, such as the D...
Cited by: More
EXPRESS'98 --- to appear - On The Expressive
(Correct)
The M-calculus: a higher-order distributed process calculus - Schmitt, al. (2003)
(Correct)
Architectural Primitives for Distribution and Mobility - Lopes, Fiadeiro, al.
(Correct)
Similar documents (at the sentence level):
61.1%: An Asynchronous Model of Locality, Failure, and Process Mobility - Amadio (1997)
(Correct)
23.3%: On Modelling Mobility - Amadio (1999)
(Correct)
Active bibliography (related documents): More All
0.3: On Bisimulations for the Asynchronous π-calculus? - Amadio, Castellani, Sangiorgi (1997)
(Correct)
0.3: On Bisimulations for the Asynchronous π-calculus - Amadio, Castellani, Sangiorgi (1996)
(Correct)
0.3: On Bisimulations for the Asynchronous π-Calculus - Amadio, Castellani, Sangiorgi (1996)
(Correct)
Similar documents based on text: More All
0.3: On Name Generation and Set-Based Analysis in the Dolev-Yao.. - Amadio, Charatonik (2002)
(Correct)
0.3: Modelling IP Mobility - Amadio, Prasad (1997)
(Correct)
0.2: Mobilité des communications IPv6 - Diagne, Noel, Pansiot
(Correct)
Related documents from co-citation: More All
5: A calculus of mobile agents
- Fournet, Gonthier et al. - 1996
4: Mobile ambients
- Cardelli, Gordon - 1998
4: Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
BibTeX entry: (Update)
Roberto M. Amadio, "An asynchronous model of locality, failure, and process mobility," in Coordination Languages and Models, Berlin, 1997, pp. 374--91, Springer-Verlag. http://citeseer.ist.psu.edu/amadio97asynchronous.html More
@inproceedings{ amadio97asynchronous,
author = "R. M. Amadio",
title = "An Asynchronous Model of Locality, Failure, and Process Mobility",
booktitle = "{Proceedings of the 2nd International Conference on Coordination Languages and Models ({COORDINATION}'97)}",
volume = "1282",
publisher = "Springer-Verlag",
address = "Berlin, Germany",
editor = "D. Garlan and D. Le M\'etayer",
pages = "374--391",
year = "1997",
url = "citeseer.ist.psu.edu/amadio97asynchronous.html" }
Citations (may not include all citations):
854
Information and Computation (context) - Milner, Parrow et al. - 1992
737
The Java programming language (context) - Arnold, Gosling - 1997
718
Distributed algorithms (context) - Lynch - 1996
414
Unreliable failure detectors for reliable distributed system..
- Chandra, Toueg - 1996
294
An object calculus for asynchronous communication
- Honda, Tokoro - 1991
291
A calculus of mobile agents
- Fournet, Gonthier et al. - 1996
271
The Oz programming model
- Smolka - 1995
242
Concurrent programming in Erlang
- Armstrong, Williams et al. - 1996
175
The weakest failure detector for solving consensus
- Chandra, Hadzilacos et al. - 1996
159
CML: A higher-order concurrent language (context) - Reppy - 1991
150
Introduction to distributed algorithms (context) - Tel - 1995
146
Typing and subtyping for mobile processes
- Pierce, Sangiorgi - 1993
86
Obliq: a language with distributed scope
- Cardelli - 1995
75
Renaming in an asynchronous environment (context) - Attiya, Bar-Noy et al. - 1990
50
A calculus of communicating systems with label passing
- Engberg, Nielsen - 1986
47
On bisimulations for the asynchronous -calculus
- Amadio, Castellani et al. - 1996
45
Asynchrony and the -calculus (context) - Boudol - 1992
44
internal mobility and agent-passing calculi (context) - Sangiorgi - 1995
30
Some chemical abstract machines (context) - Boudol - 1993
27
the expressiveness of internal mobility in name passing calc.. (context) - Boreale - 1996
13
Parametric channels via label expressions in CCS (context) - Astesiano, Zucca - 1984
7
The telescript programming guide (context) - Magic - 1997
7
From a concurrent -calculus to the -calculus (context) - Amadio, Leth et al. - 1995
7
Pict: a programming language based on the -calculus (context) - Pierce, Turner - 1996
6
The reAEexive CHAM and the join-calculus (context) - Fournet, Gonthier - 1996
3
Impossibility of distributed consenus with one faulty proces.. (context) - Fisher, Lynch et al. - 1995
3
Bisimulation and fault-tolerance
- Janowski - 1995
1
Linearity in the -calculus (context) - Kobayashi, Pierce et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998)
(Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992)
(Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC