A Caltech Library Service

Termination Detection of Diffusing Computations in Communicating Sequential Processes

Misra, Jayadev and Chandy, K. M. (1982) Termination Detection of Diffusing Computations in Communicating Sequential Processes. ACM Transactions on Programming Languages and Systems (TOPLAS), 4 (1). pp. 37-43. ISSN 0164-0925. doi:10.1145/357153.357156.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


In this paper it is shown how the Dijkstra-Scholten scheme for termination detection in a diffusing computation can be adapted to detect termination or deadlock in a network of communicating sequential processes as defined by Hoare.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 1982 ACM. Received April 1980; revised October 1980 and June 1981; accepted June 1981. This research was supported in part by the National Science Foundation under grant MCS-79-25383 and by ARPA Systems Modeling Parts II and III under grant N00039-78-G-0080. We are grateful to R. Kieburtz, S. Owicki, A. Silberschatz, and C. S. Scholten for comments on this paper. Constructive comments of the referees helped considerably in improving the exposition.
Funding AgencyGrant Number
Office of Naval Research (ONR)N00039-78-G-0080
Advanced Research Projects Agency (ARPA)UNSPECIFIED
Subject Keywords:distributed systems, networks of processes, termination detection, diffusing computation
Issue or Number:1
Record Number:CaltechAUTHORS:20190111-133115677
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92217
Deposited By: Tony Diaz
Deposited On:12 Jan 2019 17:07
Last Modified:16 Nov 2021 03:48

Repository Staff Only: item control page