A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching

Authors:
Prasannaa Thati;Reza Ziaei;Gul Agha
Affiliations:
-;-;-
Venue:
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Year:
2002

Citing 7
Cited 0

Actors: a model of concurrent computation in distributed systems

Actors: a model of concurrent computation in distributed systems
Algebraic theory of processes

Algebraic theory of processes
A calculus of mobile processes, II

Information and Computation
An Object Calculus for Asynchronous Communication

ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
On Asynchrony in Name-Passing Calculi

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Bisimulations for the Asynchronous pi-Calculus

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bisimulation in Name-Passing Calculi without Matching

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a theory of may testing for asynchronous calculi with locality and no name matching. Locality is a non-interference property that is common in systems based on object-paradigm. Concurrent languages such as Join and Pict disallow name matching, which is akin to pointer comparison in imperative languages, to provide for an abstract semantics that would allow useful program transformations. May testing is widely acknowledged to be an effective notion for reasoning about safety properties. We provide a trace-based characterization of may testing for versions of asynchronous 驴-calculus with locality and no name matching, which greatly simplifies establishing equivalences between processes. We also exploit the characterization to provide a complete axiomatization for the finitary fragment of the calculi.