Abstract
We consider a distributed system based on communication among disjoint processes, in which each process is capable of achieving a post condition of its local space in such a way that the conjunction of local post conditions implies a global post condition of the whole system. We then augment the system with extra control communication, in order to achieve distributed — termination, without adding new channels of communication. The algorithm is applied to a problem of sorted partition.
The work has been partially sponsored by NSF grant No. MSC 78-673, during my stay at USC, Los Angeles.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Brinch Hansen, P.: The Architecture of Concurrent Programming; Prentice Hall, 1977.
Brinch Hansen, P.: Distributed Processes — A Concurrent Programming Concept, CACM, 21, 11, 1978.
De Bakker, J.W.: Semantics and Termination of Nondeterministic Recursive Programs. Proc. of the 4th Conf. on Automata, Languages and Programming, 1976.
Dijkstra, E.W.: A Class of Simple Communication Patterns, EWD-643, 1978.
Dijkstra, E.W.: A Correctness Proof for Communicating Processes — A Small Exercise. EWD-607, 1977.
Francez, N.: On the Question of Termination of Concurrent Programs, May 1978, submitted to IEEE-TSE.
Francez, N., Hoare, C.A.R., Lehmann, J.D., De Roever, W.P.: Semantics of Nondeterminism, Concurrency and Communication, 1978.
Hoare, C.A.R.: Communicating Sequential Processes. CACM, 21, 8, 1978.
Milne, G. and Milner, R.: Concurrent Processes and their Syntax. Dept. of Computer Science, Edinburgh, 1977.
Sintzoff, M.: On Language Design for Program Construction; Centre de Recherche en Informatique, January 1978.
Wirth, N.: Modula — A Programming Language for Modular Programming; Software-Practice and Experience, 7, 2, March 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Francez, N. (1979). On achieving distributed termination. In: Kahn, G. (eds) Semantics of Concurrent Computation. Lecture Notes in Computer Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022476
Download citation
DOI: https://doi.org/10.1007/BFb0022476
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09511-8
Online ISBN: 978-3-540-35163-4
eBook Packages: Springer Book Archive