A foundation for actor computation

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of functional programming 1997-01, Vol.7 (1), p.1-72
Main Authors: AGHA, GUL A., MASON, IAN A., SMITH, SCOTT F., TALCOTT, CAROLYN L.
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0956-7968
1469-7653
DOI:10.1017/S095679689700261X