描述与求解哲学家就餐问题的Petri网模型研究  

The study of Petri nets models to describe and approach the dining philosophers problem

作　　者：王淑礼[1] 袁俊红[1] 江祥奎[1] 

机构地区：[1]信阳师范学院计算机科学系,河南信阳464000

出　　处：《信阳师范学院学报（自然科学版）》2004年第4期468-469,498,共3页Journal of Xinyang Normal University(Natural Science Edition)

摘　　要：研究了用 Petri网描述操作系统中经典的“并发操作”的例子——哲学家就餐问题 ,并构造了不同的 Petri网模型解决死锁和无限等待问题 ,最后讨论了轮流进餐时不同进餐次数情况下的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.

关 键 词：PETRI网 并发 锁死 操作系统 哲学家就餐问题 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]