A prime decomposition result for parallel systems

  • Authors:
  • Carroll Morgan

  • Affiliations:
  • University of Sydney, Sydney, N.S.W., Australia

  • Venue:
  • ACM SIGACT News
  • Year:
  • 1976

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose to investigate some aspects of the parallel composition of processes to form concurrent systems. We consider processes simply to be sets of possible action sequences, and define a merging operation on these sets which closely mimics parallel composition of computational processes. Synchronisation of processes is expressed in perhaps the simplest possible way: two actions in discrete processes are either independent or must occur simultaneously. This approach to synchronisation is essentially that used by Riddle [1]. A simplistic view of process behaviour is taken in the hope that those behavioural aspects which are due solely to parallel composition will be more easily identifiable, and that the parallel or sequential nature of the processes themselves may be defined in terms of the sequences they admit.