A Caltech Library Service

How processes learn

Chandy, K. Mani and Misra, Jayadev (1985) How processes learn. In: Proceedings of the fourth annual ACM symposium on Principles of distributed computing. Association for Computing Machinery , New York, NY, pp. 204-214. ISBN 0-89791-168-7.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


Processes in distributed systems communicate with one another exclusively by sending and receiving messages. A process has access to its state but not to the states of other processes. Many distributed algorithms require that a process determine facts about the overall system computation. In anthropomorphic terms, processes "learn" about states of other process in the evolution of system computation. This paper is concerned with how processes learn. We give a precise characterization of the minimum information flow necessary for a process to determine specific facts about the system.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1985 ACM. This work was supported in part by a grant from the Office of Naval Research under N00014-85-K-0057. We are indebted to Shmuel Katz, Joe Halpern, E.W. Dijkstra and Bengt Jonsson for their comments. Particular thanks go to Ernie Cohen for a careful reading of the manuscript and insightful comments.
Funding AgencyGrant Number
Office of Naval Research (ONR)N00014-85-K-0057
Record Number:CaltechAUTHORS:20190114-143721404
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92258
Deposited By: Tony Diaz
Deposited On:22 Jan 2019 23:09
Last Modified:16 Nov 2021 03:48

Repository Staff Only: item control page