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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

One common approach for verifying safety properties of multithreaded programs is assigning appropriate permissions, such as…

2013

Checking the language inclusion between two models is a fundamental problem arising in application areas such as formal…

2011

The verification of multithreaded software is still a challenge. This comes mainly from the fact that the number of thread…

2010

Recently modeling of a state transition rule has been proposed using a temporal logic based on observation (TLRO). Theadvantage…

2009

Wine lists can be powerful merchandising tools that should be thoughtfully designed. Restaurant operators and observers have…

2004

Ideally, distributed algorithms isolate the side-effects of faults within local neighborhoods of impact. Failure locality…

1999

One distributed algorithm for the dining philosophers problem 1] is implemented in Agda, a proof checker based on Martin-LL of's…

1994

We present a very simple new distributed algorithm for the classical Dining Philosophers problem. Our algorithm is the first…

1990

In 1965 Dijkstra posed and solved the Dining Philosophers problem. Since then the problem has become a classic test case for…

1982

A distributed solution to Dijkstra's ‘Dining Philosophers’ problem is presented. There is no central synchronization mechanism…