We consider monotone input/output automata, which model a usefully large class of
dataflow networks of indeterminate (or nonfunctional) processes. We obtain a …

In this paper we study concurrent, asynchronous processes and functions on them which
can be programmed using the (full) unfair or the fair merge operations. The main result is a …

The class of monotone input/output automata has been shown in the authors' previous work
to be a useful operational model for dataflow-style networks of communicating processes …

Concurrent transition systems (CTS's), are ordinary nondeterministic transition systems that
have been equipped with additional concurrency information. This concurrency information …

We use input/output automata to define a simple and general model of networks of
concurrently executing, nondeterministic processes that communicate through …

My favorite example of a simple,“interesting” identity between regular expressions is (X^*.
Y^*)^*=(X+ Y)^* This identity is true for ALL formal languages X, Y. An easy “folk” theorem …

Concurrent Machines Page 1 Concurrent Machines R/IW SHIELDS Electronics Laboratories,
The University, Canterbury, Kent CT27NT This paper starts with what seems a fairly general …

Given suitable categories T, C and functor F: T→ C, if X, Y are objects of T, then we define an
(X, Y)-relation in C to be a triple\left (R,\raise0. 3em \scriptscriptstyle- r, ̄ r\right), where R is …

We study relative computability for processes and process transformations, in general, and
in particular the non-deterministic and concurrent processes which can be specified in terms …

We introduce an operational model of concurrent systems, called concurrent automata.
These are labeled transition systems A in which the event set is endowed with a collection of …