摘要： 本文在简单介绍带有时间的Petri网后,提出了一种新的哲学家用餐问题的算法,这个算法解决了公平性,无死锁性。最后利用带有时间的Petri网理论验证了这些性质。
Abstract: After a brief introduction to the Timed Petri Net, a new algorithm for the Dining Philosophers Problem is presented which is fair to diners and free of deadlock. Then these properties are demonstrated by using the Timed Petri Net theory.
吴时霖,潘永华. 带有时间Petri网:在并发程序分析中的应用[J]. , 1987, 13(01): 9-12.
Wu Shilin. TIMED PETRI NET AND ITS APPLICATION TO PARALLEL PROGRAMS[J]. , 1987, 13(01): 9-12.