- 1
- as E. W. Dijkstra originally put it in
[Dijkstra, 1968], now more usually called deadlock.
- 2
- Using E. W. Dijkstra's
notation
*P* and *V* [Dijkstra, 1968]
for respectively acquiring and releasing a lock on a semaphore.
- 3
- Note that this is a very
geometric condition indeed.
- 4
- There is
a way to translate general semaphores
into binary semaphores, see [Dijkstra, 1968], but this uses an encoding with
integers which cannot be represented in progress graphs.
- 5
- For instance a distributed system which
does not have a global clock is such a system.
- 6
- Which appeared later, see [Fajstrup et al., 1999], not to be
completely adequate.
- 7
- Also there is a way to fully compute the
branchings, mergings and deadlocks inductively on this language.
- 8
- Also cited in chapter
``The geometry of rectangles'' in [Preparata and Shamos, 1993].
- 9
- We
refer the reader to the book
[Lynch, 1996] to have a flavour of the vast amount of results that have
been proven in the field of fault-tolerant distributed protocols.