Abstract
An important technique for fault-tolerance is that of voting on multiple instances (“versions” or “replicas”) of a system component. We consider here the application of that technique to systems of concurrent processes which interact using synchronous (“handshake”) communication. We find that having to express the voter within the usual paradigm of synchronous communication (as exhibited by e.g. CCS, CSP, OCCAM) necessitates quite stringent constraints on the behaviour of the voted-on components. We show that extending the paradigm to allow multiple simultaneous communications (as in Milner's SCCS) allows that technique to be applied to a wider class of systems.
Supported by ESPRIT BRA project DEMON and working-group CALIBAN.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. J. Abbot. Resourceful Systems for Fault Tolerance, Relilability and Safety. Computing Surveys, 22(11):36–68, March 1990.
E. Best, R. Devillers, and Javier Esparza. General Refinement and Recursion for the Box Calculus. Technical report, Department of Computer Science, University of Hildesheim, 1992.
E. Best, R. Devillers, and J. Hall. The Box Calculus: a New Causal Algebra with Multi-label Comunication. In G. Rozenberg, editor, Advances in Petri Nets: Special DEMON Issue, volume 609 of Lecture Notes in Computer Science, pages 21–69. Springer-Verlag, June 1992.
E. Best and R. P. Hopkins. B(PN)2 — A Basic Petri Net Programmming Notation. In Proceedings of PA RLE'93, volume 694 of Lecture Notes in Computer Science, pages 379–390. Springer-Verlag, June 1993.
S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A Theory of Communicating Sequential Processes. Journal of the ACM, 31:560–599, 1984.
E. C. Cooper. Replicated Distributed Programs. In Proceedings of the 10th ACM Symposium on Operating Systems Principles, volume 19(5) of Operating Systems Review, pages 63–78, December 1985.
R. P. Hopkins. Voting communications in networks of concurrent processes. Technical report, University of Newcastle upon Tyne, 1993.
INMOS. OCCAM 2 Reference Manual. Prentice Hall, 1988.
M. Koutny, L. V. Mancini, and G. Pappalardo. Formalising Replicated Distributed Processing. In Proceedings of the 10th Symposium on Reliable Distributed Systems, pages 108–117, December 1991.
L.V, Mancini and G. Pappalardo. Towards a Theory of Replicated Processing. In Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 331 of Lecture Notes in Computer Science, pages 175–192, Warwick, U.K., September 1988. Springer Verlag.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
F. D. Schneider. Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial. Computing Surveys, 22(11):300–319, December 1990.
R. De Simone. Higher Level Synchronising Devices in MEIJE-SCCS. Theoretical Computer Science, 37:245–267, 1985.
A. Tully and S. K. Shrivastava. Preventing State Divergence in Replicated Distributed Program. In Proceedinggs of the 9th Symposium on Reliable Distributed Systems, pages 104–113, Huntsville, Alabama, October 1989.
P. H. J. van Eijk, C. A. Vissers, and M. Diaz, editors. The Formal Description Technique LOTOS. North Holland, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hopkins, R.P. (1994). Voting on synchronous communications. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_93
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive