A theory of may testing for actors.

*(English)*Zbl 1048.68059
Jacobs, Bart (ed.) et al., Formal methods for open object-based distributed systems V. IFIP TC6/ WG6.1 5th international conference, FMOODS 2002, Enschede, the Netherlands, March 20–22, 2002. Boston: Kluwer Academic Publishers (ISBN 0-7923-7683-8). IFIP, Int. Fed. Inf. Process. 81, 147-162 (2002).

Summary: 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 \(A\pi\). The type system imposes a certain discipline on the use of names to capture actor properties such as uniqueness and persistence. We investigate the notion of may testing in \(A\pi\) and give a trace based characterization of it. Such a characterization simplifies reasoning about actor configurations as it does not involve quantification over all environments. We compare our characterization with that of asynchronous \(\pi\)-calculus, and highlight the differences that arise due to actor properties.

For the entire collection see [Zbl 0989.00045].

For the entire collection see [Zbl 0989.00045].

##### MSC:

68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |