Synthesis of communicating processes

  • Authors:
  • Abha Moitra

  • Affiliations:
  • -

  • Venue:
  • PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

Today's technological and economic profile make it desirable to attempt distributed solutions for a majority of computing tasks. In this paper we describe a scheme by which a sequential program can be transformed into a weakly equivalent distributed program. This transformation can, in principle, be automated and is applicable to any program written in a sequential guarded command language. The sequential program to be transformed must be accompanied by a disjoint yet complete partitioning of its variables into n sets; thereafter the program can be transformed into a system of n communicating processes written in CSP.