gen_fsm approach for the well known Dijkstra's Dining Philosophers problem.
-
Updated
Mar 8, 2017 - Erlang
gen_fsm approach for the well known Dijkstra's Dining Philosophers problem.
An implementation of the dining philosophers problem in Erlang
Add a description, image, and links to the dining-philosophers-problem topic page so that developers can more easily learn about it.
To associate your repository with the dining-philosophers-problem topic, visit your repo's landing page and select "manage topics."