Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,261,516 papers from all fields of science
Search
Sign In
Create Free Account
Dining philosophers problem
Known as:
Five philosophers
, Dining philosophers
, Drinking philosophers
Expand
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
17 relations
Algebraic Petri net
Algorithm
Cigarette smokers problem
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
You Tweet What You Eat: Studying Food Consumption Through Twitter
S. Abbar
,
Yelena Mejova
,
Ingmar Weber
CHI
2015
Corpus ID: 6965091
Food is an integral part of our lives, cultures, and well-being, and is of major interest to public health. The collection of…
Expand
Highly Cited
2012
Highly Cited
2012
Bounded synthesis
B. Finkbeiner
,
S. Schewe
International Journal on Software Tools for…
2012
Corpus ID: 8309067
A fundamental challenge in the synthesis of reactive systems is the size of the search space: the number of candidate…
Expand
2006
2006
The Dining Philosophers Problem Revisited
J. Gutknecht
JMLC
2006
Corpus ID: 25325006
We present an alternative solution to the Dining Philosophers problem that is based on Peterson’s mutual exclusion algorithm for…
Expand
Highly Cited
2005
Highly Cited
2005
Abstraction, Refinement and Proof for Probabilistic Systems
Annabelle McIver
,
Carroll Morgan
Monographs in Computer Science
2005
Corpus ID: 11034252
Probabilistic guarded commands and their refinement logic.- to pGCL: Its logic and its model.- Probabilistic loops: Invariants…
Expand
2001
2001
On the generalized dining philosophers problem
Oltea Mihaela Herescu
,
C. Palamidessi
PODC '01
2001
Corpus ID: 16057973
We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully…
Expand
Highly Cited
1991
Highly Cited
1991
Markovian Petri Net Protocols with Product Form Solution
A. Lazar
,
T. Robertazzi
Perform. Evaluation
1991
Corpus ID: 20172175
Highly Cited
1990
Highly Cited
1990
A dining philosophers algorithm with polynomial response time
B. Awerbuch
,
M. Saks
Proceedings [] 31st Annual Symposium on…
1990
Corpus ID: 11984933
Presents an efficient distributed online algorithm for scheduling jobs that are created dynamically, subject to resource…
Expand
Highly Cited
1987
Highly Cited
1987
A Generalized Timed Petri Net Model for Performance Analysis
M. A. Holliday
,
M. Vernon
IEEE Transactions on Software Engineering
1987
Corpus ID: 18145031
We have developed a Generalized Timed Petri Net (GTPN) model for evaluating the performance of computer systems. Our model is a…
Expand
Highly Cited
1984
Highly Cited
1984
The drinking philosophers problem
K. M. Chandy
,
J. Misra
TOPL
1984
Corpus ID: 5922362
The problem of resolving conflicts between processes in distributed systems is of practical importance. A conflict between a set…
Expand
Highly Cited
1981
Highly Cited
1981
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem
D. Lehmann
,
M. Rabin
POPL '81
1981
Corpus ID: 5696955
It is shown that distributed systems of probabilistic processors are essentially more powerful than distributed systems of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE