Abstract
A version of the two phase commit protocol is formally derived from its specification. The design starts with an initial design phase that properly reflects the logical structure of the protocol as a sequence of layers. Thereafter algebraic transformations are applied, resulting in an implementation that matches the physical structure of the network. Substantial use is made of an algebraic formulation of the communication closed layers design principle.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, E.-R. Olderog, Verification of sequential and concurrent programs, Springer, 1991.
P.A. Bernstein, V. Hadzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.
K.M. Chandy and J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988.
F. Critian, H. Aghili, R. Strong, D. Dolev, Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement, Proceedings 15th International Symposium on Fault-Tolerant Computing, 1985.
T. Elrad and N. Francez, Decomposition of distributed programs into communication closed layers, Science of Computer Programming 2, 1982.
R.T. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM TOPLAS 5-1, 1983.
R. J. van Glabbeek and U. Goltz, Equivalence Notions for Concurrent Systems and Refinement of Actions, Arbeitspapiere der GMD, Number 366, GMD, 1989.
J. Hooman, Specification and Compositional Verification of Real-Time Systems, Ph.D. Thesis, Eindhoven University of Technology, 1991.
W. Janssen, M. Poel and J. Zwiers, Consistent alternatives of parallelism with conflicts, Memorandum INF-91-15, University of Twente.
W. Janssen, M. Poel and J. Zwiers, Action Systems and Action Refinement in the Development of Parallel Systems, an Algebraic Approach, proceedings CONCUR '91, Springer LNCS 527, 1991.
W. Janssen, M. Poel, K. Sikkel, and J. Zwiers, The Primordial Soup Algorithm, A Systematic Approach to the Specification and Design of Parallel Parsers, Proceedings Computing Science in the Netherlands Conference, 1991.
L. Lamport, The Hoare Logic of concurrent programs, Acta Informatica 14, 1980.
S. Owicki and D. Gries, An axiomatic proof technique for parallel programs, Acta Informatica 6, 1976.
V. Pratt, Modelling Concurrency with Partial orders, International Journal of Parallel Programming 15, 1986, pp. 33–71.
M. Raynal, Distributed Algorithms and Protocols, John Wiley & Sons, 1988.
A. Segall, Distributed Network Protocols, IEEE Transactions on Information Theory, Vol. IT-29, 1983, pp. 23–35.
F.A. Stomp and W.P. de Roever, Designing distributed algorithms by means of formal sequentially phased reasoning, Proc. of the 3rd International Workshop on Distributed Algorithms, Nice, LNCS 392, Eds. J.-C. Bermond and M. Raynal, 1989, pp. 242–253.
J. Zwiers and W.P. de Roever, Predicates are Predicate Transformers: a unified theory for concurrency, Proc. of the conference on Principles of Distributed Computing, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janssen, W., Zwiers, J. (1991). Protocol design by layered decomposition. In: Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1992. Lecture Notes in Computer Science, vol 571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55092-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-55092-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55092-1
Online ISBN: 978-3-540-46692-5
eBook Packages: Springer Book Archive