Results 1 
4 of
4
The expressive power of parallelism
, 1990
"... We explore an algebraic language for networks consisting of a fixed number of reactive units, communicating synchronously over a fixed linking structure. The language has only two operators: disjoint parallelism, where two networks are composed in parallel without any interconnections, and linking, ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We explore an algebraic language for networks consisting of a fixed number of reactive units, communicating synchronously over a fixed linking structure. The language has only two operators: disjoint parallelism, where two networks are composed in parallel without any interconnections, and linking, where an interconnection is formed between two ports. The intention is that these operators correspond to the primitive steps when constructing networks, and that they therefore are conceptually simpler than the operators in existing process algebras. We investigate the expressive power of our language. The results are: (1) Definability of behaviours: with only three simple processing units, every finitestate behaviour can be constructed. (2) Definability of operators: we characterise the network operators which are definable within the language," these turn out to include most operators previously suggested for describing parallelism. Our results hold for any congruence between trace equivalence and observation equivalence.
Graphical Construction of Parallel Programs
 IN 2ND INT. CONF. ON SOFTWARE FOR MULTIPROCESSORS AND SUPERCOMPUTERS: THEORY, PRACTICE, AND EXPERIENCE
, 1994
"... Parallel programming is not difficult, as the programs build up their complex behaviours in a similar way to the real world (i.e through the simple interaction of independent and simple entities). The parallel system engineer needs, however, a systematic method to decomposing the networks into indep ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Parallel programming is not difficult, as the programs build up their complex behaviours in a similar way to the real world (i.e through the simple interaction of independent and simple entities). The parallel system engineer needs, however, a systematic method to decomposing the networks into independent ones or composing existing processes to form new networks. In this paper, we introduce a technique for the graphical construction of hierarchical networks (or configurations) of processes. The technique focuses on the concept of templates which define reusable patterns of communication and synchronisation for processes. We introduce a set of graphical rules based on the equivalence between processes, more specifically templates, and networks (configurations) of templates. The rules can be used to decompose networks of processes by substituting a single process for an equivalent subnetwork of processes, or to abstract a subnetwork of processes as a single process in order to simplify complex networks.
Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation
, 1994
"... . This paper proposes a framework for the integration of the algebra of communicating processes (ACP) and the algebra of flownomials (AF). Basically, this means to combine axiomatisations of parallel and looping operators. To this end a model of process graphs with multiple entries and exits is intr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. This paper proposes a framework for the integration of the algebra of communicating processes (ACP) and the algebra of flownomials (AF). Basically, this means to combine axiomatisations of parallel and looping operators. To this end a model of process graphs with multiple entries and exits is introduced. In this model the usual operations of both algebras are defined, e.g. alternative composition, sequential composition, feedback, parallel composition, left merge, communication merge, encapsulation, etc. The main results consist of correct and complete axiomatisations for process graphs modulo isomorphism and modulo bisimulation. 1
Processes with Multiple Entries and Exits
, 1995
"... This paper is an attempt to integrate the algebra of communicating processes (ACP) and the algebra of ownomials (AF). Basically, this means to combine axiomatized parallel and looping operators. To this end we introduce a model of process graphs with multiple entries and exits. In this model the usu ..."
Abstract
 Add to MetaCart
This paper is an attempt to integrate the algebra of communicating processes (ACP) and the algebra of ownomials (AF). Basically, this means to combine axiomatized parallel and looping operators. To this end we introduce a model of process graphs with multiple entries and exits. In this model the usual operations of both algebras are dened, e.g. alternative composition (this covers both the sum of ACP and the disjoint sum of AF), sequential composition, feedback, parallel composition, left merge, communication merge, encapsulation, etc. The main results consist of correct and complete axiomatisations of process graphs modulo isomorphism and modulo bisimulation. Key words & Phrases: process algebra, feedback, owchart theories. 1