Exposure to Deadlock for Communicating Processes is Hard to Detect

Authors:
Thomas Raeuchle;Sam Toueg
Affiliations:
-;-
Venue:
Exposure to Deadlock for Communicating Processes is Hard to Detect
Year:
1983

Citing 0
Cited 3

A survey of distributed deadlock detection algorithms

ACM SIGMOD Record
Deadlock detection in distributed databases

ACM Computing Surveys (CSUR)
On the analysis of cooperation and antagonism in networks of communicating processes

Proceedings of the fourth annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the applicability of global state analysis as a tool for proving correctness of communication protocols is rather limited. Brand, et al. showed that reachability of global deadlock states for protocols with unbounded FIFO channels is undecidable. It is shown, that the same is true for unbounded non-FIFO channels. For bounded FIFO channels the problem is shown to be PSPACE-hard. Protocols with bounded non-FIFO channels are shown to be analyzable in polynomial time.