The two-step commitment protocol: Modeling, specification and proof methodology

Authors:
J. L. Baer;G. Gardarin;C. Girault;G. Roucairol
Affiliations:
-;-;-;-
Venue:
ICSE '81 Proceedings of the 5th international conference on Software engineering
Year:
1981

Citing 6
Cited 2

Concurrency control in a system for distributed databases (SDD-1)

ACM Transactions on Database Systems (TODS)
Petri Nets

ACM Computing Surveys (CSUR)
Formal verification of parallel programs

Communications of the ACM
The Analysis of Distributed Systems by Means of Predicate ? Transition-Nets

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Linear Algebra in Net Theory

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Notes on Data Base Operating Systems

Operating Systems, An Advanced Course

A distributed transaction processing protocol based on majority consensus

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Performance Analysis Using Stochastic Petri Nets

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A two-step commitment algorithm which assures transaction update atomicity in a distributed data base is modelled using colored Petri Nets. The modeling helps in determining the numerous crash possibilities and in specifying recovery procedures and associated protocols. The use of unalterable logs is required and modelled accordingly. A methodology for proof correctness based on linear invariants is presented.