A theory of may testing for actors

Prasannaa Thati, Reza Ziaei, Gul Agha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationFormal Methods for Open Object-Based Distributed Systems V - IFIP TC6 / WG6.1 5th International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2002
PublisherSpringer
Pages147-162
Number of pages16
ISBN (Print)9781475752687
DOIs
StatePublished - 2002
EventIFIP TC6 / WG6.1 5th International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2002 - Enschede, Netherlands
Duration: Mar 20 2002Mar 22 2002

Publication series

NameIFIP Advances in Information and Communication Technology
Volume81
ISSN (Print)1868-4238

Other

OtherIFIP TC6 / WG6.1 5th International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2002
Country/TerritoryNetherlands
CityEnschede
Period3/20/023/22/02

Keywords

  • Actors
  • Interaction paths
  • May testing
  • π-calculus

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'A theory of may testing for actors'. Together they form a unique fingerprint.

Cite this