A foundation for actor computation

  • Authors:

  • Gul A. Agha;Ian A. Mason;Scott F. Smith;Carolyn L. Talcott

  • Affiliations:

  • University of Illinois at Urbana-Champaign, IL, USA (e-mail: agha@cs.uiuc.edu);University of New England, Armidale, NSW, Australia (e-mail: ian.turing@.une.edu.au);The Johns Hopkins University, Baltimore, MD, USA (e-mail: scott@cs.jhu.edu);Stanford University, Stanford, CA, USA (e-mail: clt@sail.stanford.edu)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an actor language which is an extension of a simple functional language, and provide an operational semantics for this extension. Actor configurations represent open distributed systems, by which we mean that the specification of an actor system explicitly takes into account the interface with external components. We study the composability of such systems. We define and study various notions of testing equivalence on actor expressions and configurations. The model we develop provides fairness. An important result is that the three forms of equivalence, namely, convex, must, and may equivalences, collapse to two in the presence of fairness. We further develop methods for proving laws of equivalence and provide example proofs to illustrate our methodology.