A Theory of May Testing for Actors
Prasannaa Thati, Reza Ziaei, Gul Agha · 2002
The Actor model and π -calculus have served as the basis of a large body of research on concurrency. We represent the Actor model as a typed asynchronous π -calculus, called A π . 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 π 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 π -calculus, and highlight the differences that arise due to actor properties.