Abstract
The notion of receptiveness arises in the pi-calculus as a
guarantee of determinacy in the behaviour of callable entities and was
first investigated by Sangiorgi.
The DpiF process calculus, introduced by Francalanza and Hennessy,
extends the pi-calculus with located processes and location and
link failures. In this paper we extend the notion of receptiveness to
DpiF and give sound characterizations of the property of linear
uniform receptiveness in DpiF in the form of two type systems.
Our first type system ensures receptiveness, the property that no
pending output will ever be left unattended. We achieve this by
ensuring linearity and by ensuring that the input and output remain at
the same location, such that location failure will effectively remove
either both or none. Our second type system allows for migration but
ensures that input capabilities remain within locations which are
hidden from the context and thus not subject to failures.
guarantee of determinacy in the behaviour of callable entities and was
first investigated by Sangiorgi.
The DpiF process calculus, introduced by Francalanza and Hennessy,
extends the pi-calculus with located processes and location and
link failures. In this paper we extend the notion of receptiveness to
DpiF and give sound characterizations of the property of linear
uniform receptiveness in DpiF in the form of two type systems.
Our first type system ensures receptiveness, the property that no
pending output will ever be left unattended. We achieve this by
ensuring linearity and by ensuring that the input and output remain at
the same location, such that location failure will effectively remove
either both or none. Our second type system allows for migration but
ensures that input capabilities remain within locations which are
hidden from the context and thus not subject to failures.
| Originalsprog | Engelsk |
|---|---|
| Titel | Proceedings of CATS 2010 - Computing : The Australasian Theory Symposium |
| Vol/bind | 109 |
| Forlag | Australian Computer Society |
| Publikationsdato | 2010 |
| ISBN (Trykt) | 978-1-920682-90-3 |
| Status | Udgivet - 2010 |
| Navn | Conferences in Research and Practice in Information Technology |
|---|---|
| Vol/bind | 109 |