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.