Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 1982 | public
Journal Article

Termination Detection of Diffusing Computations in Communicating Sequential Processes

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

Created:
August 19, 2023
Modified:
October 20, 2023