论文信息 - Correctness proof for the majority consensus algorithm - 字舞流文

Correctness proof for the majority consensus algorithm

Abstract We give a formal proof of correctness of the Thomas majority consensus algorithm using temporal logic.

R. K. Shyamasundar | A. Ravichandran

[1] Philip A. Bernstein,et al. Concurrency Control in Distributed Database Systems , 1986, CSUR.

[2] Robert H. Thomas,et al. A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[3] Philip A. Bernstein,et al. Formal Aspects of Serializability in Database Concurrency Control , 1979, IEEE Transactions on Software Engineering.

[4] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.

[5] Philip A. Bernstein,et al. Categories and Subject Descriptors: H.2.4 [Database Management]: Systems. , 2022 .

[6] Jim Gray,et al. A Transaction Model , 1980, ICALP.

[7] P. M. Melliar-Smith,et al. Temporal Logic Specification of Distributed Systems , 1981, ICDCS.