Bisimulation for higher-order process calculi
Information and Computation
The name discipline of uniform receptiveness
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Resource access control in systems of mobile agents
Information and Computation
Imperative objects as mobile processes
Science of Computer Programming
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
The receptive distributed π-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type inference for a distributed π-calculus
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
| Hi-index | 0.00 |
The notion of receptiveness arises in the π-calculus as a guarantee of determinacy in the behaviour of callable entities and was first investigated by Sangiorgi. The DπF process calculus, introduced by Francalanza and Hennessy, extends the π-calculus with located processes and location and link failures. In this paper we extend the notion of receptiveness to DπF and give sound characterizations of the property of linear uniform receptiveness in DπF 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.