Representation of process synchronization

  • Authors:
  • Robert C. Chen

  • Affiliations:
  • Dept. of Computer and Information Science, Moore School D2, University of Pennsylvania, Philadelphia, Pennsylvania

  • Venue:
  • Proceedings of the 1975 ACM SIGCOMM/SIGOPS workshop on Interprocess communications
  • Year:
  • 1975

Quantified Score

Hi-index 0.00

Visualization

Abstract

There is presently no natural, convenient way to represent synchronization between communicating processes. Two dimensional graph models seem to offer the most natural representations, and of these the Petri net is perhaps the most basic. The author has been working on graph models similar to Petri nets, stressing the ease and convenience of the model as a descriptive device rather than attempting to prove properties such as liveness and safeness. It is shown that Petri nets are incapable of representing some simple and interesting synchronization problems such as reader-writer problems. Recent work has been directed towards the identification of modifications to graph models to overcome such dificiencies.