| 描述与求解哲学家就餐问题的Petri网模型研究 |
| |
| 引用本文： | 王淑礼,袁俊红,江祥奎.描述与求解哲学家就餐问题的Petri网模型研究[J].信阳师范学院学报(自然科学版),2004,17(4):468-469,498. |
| |
| 作者姓名： | 王淑礼 袁俊红 江祥奎 |
| |
| 作者单位： | 信阳师范学院,计算机科学系,河南,信阳,464000 |
| |
| 摘 要： | 研究了用Petri网描述操作系统中经典的“并发操作”的例子——哲学家就餐问题，并构造了不同的Petri网模型解决死锁和无限等待问题，最后讨论了轮流进餐时不同进餐次数情况下的Petri网构造问题。
|
| 关 键 词： | Petri网 并发 锁死 操作系统 哲学家就餐问题 |
| 文章编号： | 1003-0972(2004)04-0468-02 |
The study of Petri nets models to describe and approach the dining philosophers problem |
| |
| WANG Shu-li,YUAN Jun-hong,JIANG Xiang-kui.The study of Petri nets models to describe and approach the dining philosophers problem[J].Journal of Xinyang Teachers College(Natural Science Edition),2004,17(4):468-469,498. |
| |
| Authors: | WANG Shu-li YUAN Jun-hong JIANG Xiang-kui |
| |
| Abstract: | The dining philosophers problem is a classic example of describing "Concurrency operation" in operating system. The paper studies it in petri nets and builds different petri nets models to solve the deadlock problem and the infinite waiting problem respectively, and finally discusses the models of petri nets in the situation of different dining times when philosophers are dining in turn. |
| |
| Keywords: | Petri nets concurrency deadlock operating system dining philosophers problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
