微信服务号

微信订阅号

Home > Archive>Volume 4, Issue 3, 1993 >53-57
PDF HTML XML Export Cite reminder
AN ASSERTIONAL PROOF FOR PETERSON-FISCHER 2-MUTUAL ALGORITHM
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

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

    Reference
    Related
    Cited by
Get Citation

苏运霖.关于Peterson—Fischer二进程算法的断言式证明.软件学报,1993,4(3):53-57

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 13,1990
  • Revised:April 22,1991
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063