István Cserny
Modified version oft the Dining Philosopher Problem - here any chopstick can be used, so the five chopstick are represented báy a counting semaphore initialized with a value of 5.
Changes
| Revision | Date | Who | Commit message |
|---|---|---|---|
| 0:3def6e6a9e93 | 2022-03-17 | cspista | Final version |