PetriNetDiningPhilosophers

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 as:

The Java Web Start version is preferred, though browsers with versions of Java earlier than Java 1.6.0_13 may only work with the applet version. See Web Start Help for details.