A note on deadlock-free proofs of network of processes

  • Authors:

  • H. Zedan

  • Affiliations:

  • Bristol University, BRISTOL, ENGLAND, U.K.

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

The processes in a network are categorized according to their functionalities at a given stage in the computation. A simple criterion for total correctness of a set of communicating processes is also given along with a necessary and sufficient condition to prove the absence of deadlock.