The classical problem of the dining philosophers relates n
philosophers sitting around a table; each one has
its own dish, and they can only eat or think.
When they, independently, decide to eat, they need two forks.
There is only one fork between two dishes (i.e. n forks).
The link-calculus model, for each philosopher is:
Also the forks are modeled as processes:
Using the multiparty interaction, the resulting
abstract level is not subject to the deadlock problem.
Therefore, one can focus on other properties, such as a specific fairness
solution.
Here
there is an implementation in the link-calculus, and its labelled
transition system by executing the symbolic semantics of the link-calculus.