AN ASSERTIONAL PROOF FOR PETERSON-FISCHER 2-MUTUAL ALGORITHM
关于Peterson—Fischer二进程算法的断言式证明

This paper purports to present an assertional proof for Peterson-Fischer 2-mutual exclusion algorithm. According to Nancy A. Lynch of MIT1], this was an open problem. Hence the significance of this paper is to fill the gap.