Abstract
In distributed systems, message passing is a low level representation of communication resulting in intricate designs and proofs. This paper presents a new abstraction to express communication: the observation. This notion provides a more concise expression of programs and properties, and consequently is an effective help in understanding and reasoning about distributed algorithms. Observations are formalized in the Unity framework.
We define the observation relation and state its main properties. Then, we present the description and the proof of a generic problem. The abstract level of description separates concerns between the algorithm and its communication pattern. Thus, the topology of observations can be changed while preserving the algorithm properties.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Gregory R. Andrews and Fred B. Schneider. Concepts and notations for concurrent programming. Computing Surveys, 15(1):3–43, March 1983.
K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
M. Charpentier, M. Filali, P. Mauran, G. Padiou, and P. Quéinnec. Répartition par observation dans Unity. Technical Report 96-01-R, IRIT, 27 pages, January 1996.
Michel Charpentier. Une sémantique pour Unity avec section observe. Technical report, IRIT, April 1996.
Michel Charpentier, Abdellah El Hadri, and Gérard Padiou. A Unity-based algorithm design assistant. In Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 131–145, Aarhus, Denmark, May 1995. BRICS Notes Series NS-95-2.
Vilay K. Garg. Principles of Distributed Systems. Kluwer Academic Publisher, 1996.
Rob Gerth and Amir Pnueli. Rooting UNITY. In Proc. fifth Int. Workshop on Software Specification and Design, pages 11–19, May 1989.
David Moshe Goldschlag. Mechanically Verifiyng Concurrent Programs. PhD thesis, University of Texas at Austin, May 1992.
M.J.C. Gordon and T.F. Melham. Introduction to HOL: A Theorem Proving Environnement for Higher Order Logic. Cambridge University Press, 1993.
C. A. R. Hoare. Coomunicating Sequential Processes. Prentice-Hall International, 1984.
Leslie Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.
Friedemann Mattern. Algorithms for distributed termination detection. Distributed Computing, 2:161–175, 1987.
Jayadev Misra. A logic for concurrent programming. Technical report, The University of Texas at Austin, April 1994.
G. Ricart and A.K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1):9–17, January 1981.
Beverly A. Sanders. Eliminating the substitution axiom from Unity logic. Formal Aspects of Computing, 3(2):189–205, 1991.
R.T. Udink and J.N. Kok. On the relation between Unity properties and sequence of states. In J.W de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science, pages 594–608, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Charpentier, M., Filali, M., Mauran, P., Padiou, G., Quéinnec, P. (1996). Abstracting communication to reason about distributed algorithms. In: Babaoğlu, Ö., Marzullo, K. (eds) Distributed Algorithms. WDAG 1996. Lecture Notes in Computer Science, vol 1151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61769-8_7
Download citation
DOI: https://doi.org/10.1007/3-540-61769-8_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61769-3
Online ISBN: 978-3-540-70679-3
eBook Packages: Springer Book Archive