Abstract
A concurrent program finding Euler paths in a graph is described, proved and analysed. The importance of atomic actions is particularly stressed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Best, E.: Atomicity of Activities. In: Proceedings of the Advanced Course in General Net Theory, Springer Lecture Notes in Computer Science, to appear in 1980.
Di jkstra, E.W.: A Discipline of Programming. Prentice Hall 1976.
iDijkstra, E.W.: Finding the Correctness Proof of a Concurrent Program. Proc. of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, Series A, Vol. 81(2), June 1978.
Dijkstra, E.W., Lamport, L., Martin, A.J., Scholten, C.S. and Steffens, E.F.M.: On-the-Fly Garbage Collection: An Exercise in Co-operation. CACM 21/11, November 1978, pp. 966–975.
Ore, O.: Theory of Graphs. American Mathematical Society, Colloquium Publications, Vol. XXXVIII, Rhode Island 1962.
Owicki, S. and Gries, D.: An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6/1976, pp. 319–340.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E. (1980). Proof of a concurrent program finding Euler paths. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022501
Download citation
DOI: https://doi.org/10.1007/BFb0022501
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive