Abstract
The purpose of this paper is twofold, viz. to present a new [0] algorithm for the detection of the termination of a distributed computation and to demonstrate how the algorithm can be derived in a number of steps.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Termination Detection for Diffusing Computations, Edsger W.Dijkstra and C.S.Scholten, Inf. Processing Letters, Vol. 11, 1, (1980), pp. 1–4.
Distributed State Exploration for Protocol Validation, Mohamed G.Gouda, Technical Report 185, October 1981, Department of Computer Sciences, University of Texas at Austin, Austin, U.S.A.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dijkstra, E.W., Feijen, W.H.J., van Gasteren, A.J.M. (1986). Derivation of a termination detection algorithm for distributed computations. In: Broy, M. (eds) Control Flow and Data Flow: Concepts of Distributed Programming. Springer Study Edition, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82921-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-82921-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17082-2
Online ISBN: 978-3-642-82921-5
eBook Packages: Springer Book Archive