The dining philosophers problem is about deadlock in concurrent systems. The dining philosophers problem is explained with example programs.