A theory of may testing for actors
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
| Hi-index | 0.00 |
The Actor model and pi-calculus have served as the basis of a large body of research on concurrency. We represent the Actor model as a typed asynchronous pi-calculus, called api-calculus. The type system imposes a certain discipline on the use of names to capture actor properties. Since the reduction semantics of api-calculus is the same as that of pi-calculus, we have a basis for direct comparison between actors and pi-calculus. We investigate the notion of may testing in api-calculus and give a trace based characterization of it. We also present two variants of api-calculus that differ in name matching capabilities, and discuss possible approaches to alternate characterizations of may testing for them. Our characterizations are closely related to those for variants of asynchronous pi-calculus. We present a detailed comparison of our characterizations with them.