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.