On message deliverability and non-uniform receptivity

Authors:
Roberto Amadio;Gerard Boudol;Cedric Lhoussaine
Affiliations:
Université de Provence, Laboratoire d'Informatique Fondamentale de Marseille, 39, rue F. Joliot Curie 13453, Marseille, Cedex 13, France;INRIA, 2004, Route des Lucioles B.P. 93, 06902 Sophia-Antipolis, Cedex, France;School of Cognitive and Computing Sciences, University of Sussex Falmer Brighton, BN1 9QN, UK
Venue:
Fundamenta Informaticae
Year:
2002

Citing 12
Cited 0

The mathematics of Petri nets

The mathematics of Petri nets
The reflexive CHAM and the join-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bisimulations of the asynchronous &pgr;-calculus

Theoretical Computer Science
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
On modelling mobility

Theoretical Computer Science
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract)

ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
On the Relationship of CCS and Petri Nets

Proceedings of the 11th Colloquium on Automata, Languages and Programming
The Name Discipline of Uniform Receptiveness (Extended Abstract)

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Asynchronous Model of Locality, Failurem and Process Mobility

COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
On the bisimulation proof method

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The message deliverability property requires that every emitted message has a chance of being received. In the context of the asynchronous π-calculus, we introduce a discipline of non-uniform receptivity that entails this property. Adopting this discipline requires a style of programming where resources are persistent. We give a general method to transform (in a fully abstract way) a process so that it complies with the discipline.