Skip to main content
SpringerLink
Log in

Assertional verification of a majority consensus algorithm for concurrency control in multiple copy databases

  • Selected Papers
  • Conference paper
  • First Online:
CONCURRENCY 88 (CONCURRENCY 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 335))

Included in the following conference series:

  • 136 Accesses

Abstract

The majority consensus algorithm of Thomas [Thom79] for concurrency control in multiple copy databases is proved correct, using system-wide invariants. The specification of the algorithm is extended to a more formal and more complete form. It is shown that the algorithm as given by Thomas does not guarantee internal consistency, but that a slightly modified form does. We also describe a modification in which votes need not be remembered.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ceri, S., and G. Pelagatti: Distributed Databases. Principles and systems. McGraw-Hill Book Company, London,1985.

    Google Scholar 

  2. Drost, N.J., and J. van Leeuwen: Assertional verification of a Majority Consensus Algorithm for Concrrency control in Multiple Copy Databases. Techn. Rep. RUU-CS-88-13, Dept. of Computer Science, University of Utrecht, Utrecht. 1988.

    Google Scholar 

  3. Drost, N.J., and A.A. Schoone: Assertional Verification of a Reset Algorithm. Techn. Rep. RUU-CS-88-5, Dept. of Computer Science, University of Utrecht, Utrecht. 1988.

    Google Scholar 

  4. Jonsson,B.: Modular Verification of Asynchronous Networks. Proc. 6th Annual ACM Symp. on Principles of Distributed Computing, Vancouver, pp. 152–166, 1987.

    Google Scholar 

  5. Knuth, D.E.: Verification of Link-Level Protocols. BIT 21:31–36. 1981.

    Google Scholar 

  6. Krogdahl, S.: Verification of a Class of Link-Level Protocols. BIT 18:436–448. 1978.

    Google Scholar 

  7. Lamport, L.: An Assertional Correctness Proof of a Distributed Algorithm. Science of Computer Programming 2:175–206. 1982.

    Article  Google Scholar 

  8. Schoone, A.A.: Verification of Connection-Management Protocols. Techn. Rep. RUU-CS-87-14, Dept. of Computer Science, University of Utrecht, Utrecht. 1987.

    Google Scholar 

  9. Schoone, A.A. and J. van Leeuwen: Verification of Balanced Link-Level Protocols. Techn. Rep. RUU-CS-85-12, Dept. of Computer Science, University of Utrecht, Utrecht. 1985. (Revised version to appear in BIT).

    Google Scholar 

  10. Tel, G.: Assertional Verification of a Timer-based Protocol. Techn. Rep. RUU-CS-87-15, Dept. of Computer Science, University of Utrecht, Utrecht. 1987.

    Google Scholar 

  11. Thomas, R.H.: A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. on Database Systems 4,2:180–209,1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Logic, University of Utrecht, P.O.Box 80.013, 3508 TA, Utrecht, the Netherlands

    Nicolien J. Drost

  2. Dept. of Computer Science, University of Utrecht, P.O.Box 80.089, 3508 TB, Utrecht, the Netherlands

    J. van Leeuwen

Authors
  1. Nicolien J. Drost
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. van Leeuwen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frederich H. Vogt

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drost, N.J., van Leeuwen, J. (1988). Assertional verification of a majority consensus algorithm for concurrency control in multiple copy databases. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-50403-6_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50403-0

  • Online ISBN: 978-3-540-45999-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation