Published January 1982
| public
Journal Article
Termination Detection of Diffusing Computations in Communicating Sequential Processes
- Creators
- Misra, Jayadev
- Chandy, K. M.
Chicago
An error occurred while generating the citation.
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.
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.Additional details
- Eprint ID
- 92217
- Resolver ID
- CaltechAUTHORS:20190111-133115677
- NSF
- MCS-79-25383
- Office of Naval Research (ONR)
- N00039-78-G-0080
- Advanced Research Projects Agency (ARPA)
- Created
-
2019-01-12Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field