Dining philosophers problem

Known as: Five philosophers, Dining philosophers, Drinking philosophers 
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization… (More)
Wikipedia

Related topics

Related topics

17 relations
Algebraic Petri netAlgorithmCigarette smokers problemComputer science
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Agent based solution for dining philosophers problem
Dining philosophers problem is a typical example of inter process synchronization problem where various resources need to be… (More)
  • figure 1
Is this relevant?
2010
2010
Application of TLRO to dining philosophers problem
Recently modeling of a state transition rule has been proposed using a temporal logic based on observation (TLRO). Theadvantage… (More)
  • figure 1
  • table 1
Is this relevant?
2007
2007
Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem
Dijkstra's weakest precondition calculus is used to model the well known Dining Philosophers problem. Process and state… (More)
  • figure 1
Is this relevant?
2001
2001
On the generalized dining philosophers problem
We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock
FDR (Failures-Divergence Refinement) [6] is a model-checking tool for C S P [10]. Except for the recent addition of determinism… (More)
Is this relevant?
1994
1994
An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem
This paper presents an algorithm for the dining philosophers problem with a failure locality of two, i.e. in the presence of… (More)
  • table 1
  • table 2
Is this relevant?
1986
1986
An optimal distributed solution to the dining philosophers problem
An optimal distributed solution to the dining philosophers problem is presented. The solution is optimal in the sense that it… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The Drinking Philosopher's Problem
– five philosophers (thinking, hungry, and eating) around a table – five chopsticks and a bowl of rice – when hungry, a… (More)
Is this relevant?
1984
1984
A robust distributed solution to the generalized Dining Philosophers problem
In this note, we discuss a generalization to Dijkstra's Dining Philosophers problem and a distributed solution to it. We also… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1981
Highly Cited
1981
On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem
It is shown that distributed systems of probabilistic processors are essentially more powerful than distributed systems of… (More)
Is this relevant?