The Dining Philosophers Problem is a common concurrency problem.
In this model, there are 5 chopsticks, represented by p0 through p4.
There are 5 philosophers, represented by p5 through p9.
For a philosopher to eat, they must use their left and right chopsticks
PetriNetDiningPhilosophers is available in two formats: