The complexity of problems in systems of communicating sequential processes (Extended Abstract)

  • Authors:

  • Richard E. Ladner

  • Affiliations:

  • -

  • Venue:
  • STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

There is a wide-spread belief among computer scientists that systems of communicating sequential processes are harder to analyze than purely sequential processes. The belief is largely based on the observation that the parallelism in such systems leads to a large number of possible interleavings of the actions of the different processes. We will show that other evidence supporting this belief is that the properties we are trying to analyze about these systems are themselves intrinsically complex. They are properties that make no sense when they are applied to purely sequential processes, or even parallel systems of sequential processes that have no ability to communicate with each other.