Journal ArticleOPEN ACCESS

Termination Detection of Diffusing Computations in Communicating Sequential Processes

ACM Transactions on Programming Languages and Systems (TOPLAS) (1982) 4(1) 37-43
DOI: 10.1145/357153.357156
53Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

Abstract

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. © 1982, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Misra, J., & Chandy, K. M. (1982). Termination Detection of Diffusing Computations in Communicating Sequential Processes. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(1), 37–43. https://doi.org/10.1145/357153.357156

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free