CS ST0279 -- Distributed Calculus and Coordination
Homework 5
2011
The Philosophers problem:
The Dining Philosophers Problem, Dijkstra, 1968.
Problem description:
- n philosophers are to dinner and share a round table with to the center a bowl of rice,
- each philosopher can only eat or to think about,
- each philosopher need two sticks to eat,
- there are only n sticks and n dishes. Each philosopher has a dish at the disposal and a stick to his left,
- each philosopher may only use the stick to his left and the stick to his right.
Prove the CCS description given in lesson slide is deadlock free.