Temporal Petri nets model of concurrent systems
In this paper, we use temporal Petri nets as a tool for designing a model of the dining philosopher's problem. On the one, hand, we describe the systemic construction and dynamic action of this problem by using Petri nets; on the other hand, we use temporal logic to represent formally requirement criterion of the systemic verification. Then, combining the method of reachability of Petri nets and induction of temporal logic formulas, we analyze and verify the properties of the dining philosopher's problem, such as reachability, Mutual exclusion and starvation-free.
petri net dining philosopher's problem temporal logical