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.

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…

2011

2010

If philosophical moral reflection improves moral behavior, one might expect ethics professors to behave morally better than…

2005

The aim of this paper is to use the algebraic theory of pro- cesses as a formal method applied for modelling the behaviour of a…

2005

1999

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

1997

interpretation: AbsStore = fe; og a x<3 ! a for a 2 AbsStore a :(x<3) ! a for a 2 AbsStore e x:=x+1 ! o o x:=x+1 ! e Abstract…

1995

One of the obstacles in introducing Ada in undergraduate curricula has been the lack of Ada program development environments with…

1981

For an independent and graphical representation of the constraints in distributed system parts the formalism of Loosely Coupled…