Dodatkowe przykłady dopasowywane są do haseł w zautomatyzowany sposób - nie gwarantujemy ich poprawności.
Examples of such problems include the dining philosophers problem and other similar mutual exclusion problems.
The following picture describes an algebraic Petri net model of the "dining philosophers problem".
However, the difficulties studied in the Dining philosophers problem arise far more often when multiple processes access sets of data that are being updated.
Illustration of the dining philosophers problem (Java applet)
Despite the word dining, the dining cryptographers problem is unrelated to the dining philosophers problem.
The dining philosophers problem is a classical problem sufficiently difficult to expose many of the potential pitfalls of newly proposed primitives.
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them.
Even if all processes follow these rules, multi-resource deadlock may still occur when there are different resources managed by different semaphores and when processes need to use more than one resource at a time, as illustrated by the dining philosophers problem.
He also developed Hoare logic for verifying program correctness, and the formal language Communicating Sequential Processes (CSP) to specify the interactions of concurrent processes (including the dining philosophers problem) and the inspiration for the occam programming language.
In 1984, K. Mani Chandy and A. Aggarwal proposed a different solution to the dining philosophers problem to allow for arbitrary agents (numbered P, ..., P) to contend for an arbitrary number of resources, unlike Dijkstra's solution.