Skip to main content

A foundation for actor computation

  • GUL A. AGHA (a1), IAN A. MASON (a2), SCOTT F. SMITH (a3) and CAROLYN L. TALCOTT (a4)
    • Published online: 01 January 1997

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.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 1
Total number of PDF views: 50 *
Loading metrics...

Abstract views

Total abstract views: 345 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th April 2018. This data will be updated every 24 hours.