A small calculus for concurrent objects
- 1 April 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN OOPS Messenger
- Vol. 2 (2) , 50-54
- https://doi.org/10.1145/127070.127079
Abstract
This brief paper introduces a small anonymous formal system representing the core theory of concurrent object-based computing. Milner's π-calculus is its underlying formalism, but the original calculus is reinterpreted and reformulated to become a simple and powerful expression of concurrent object-based computing. We briefly describe its underlying computational framework, its syntax, transition rules, semantic equivalence, and its special properties concerning "naming", which makes this calculus unique among various concurrency formalisms.Keywords
This publication has 3 references indexed in Scilit:
- Concurrent aggregates: using multiple-access data abstractions to manage complexity in concurrent programsPublished by Association for Computing Machinery (ACM) ,1991
- The chemical abstract machinePublished by Association for Computing Machinery (ACM) ,1990
- Viewing control structures as patterns of passing messagesArtificial Intelligence, 1977