Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.Includes bibliographical references (leaf 35).by Christopher P. Colby.B.S

Colby, Christopher P

The Peterson-Fischer 2-process mutual exclusion algorithm [PF] is introduced in a slightly modified form. An invariant-assertional proof of mutual exclusion is presented for the 2-process algorithm. Next, the Peterson-Fischer n-process mutual exclusion algorithm is introduced con-ceptually as a tournament of [lg n] 2-process competitions. A mutual-exclusion proof of the n-process algorithm is presented, based on a mapping between states of the n-process system and states of the 2-process system. This mapping delineates the correspondence between the 2-process code and one iteration (competition) of the n-process code. In this way, the statement of correctness of the 2-process algorithm is used as a lemma for the n-process proof

Christopher P. Colby

CiteSeerX

Correctness Proofs of the Peterson-Fischer Mutual Exclusion Algorithms

DSpace@MIT

Correctness proofs of the Peterson-Fischer mutual exclusion algorithms

http://dspace.mit.edu/bitstream/1721.1/80454/2/20972454-MIT.pdf

Correctness proofs of the Peterson-Fischer mutual exclusion algorithms

Abstract

Similar works

Full text

Available Versions

CiteSeerX

DSpace@MIT