The expressiveness of concurrent data ow primitives have been studied from the point of
view of automata theory 19] as well as in terms of abstractly given processes de ned in terms …

We investigate the power of Kahn-style dataflow networks, with processes that may exhibit
indeterminate behavior. Our main result is a theorem about networks of “monotone” …

We analyze the relative expressive power of variants of the indeterminate fair merge
operator in the context of static dataflow. We establish that there are three different, provably …

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 …

In this paper we establish that fair merge is a powerful non-determinate primitive that cannot
be implemented in terms of other well-known primitives. It is well known that fair merge …

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 thesis we prove the equivalence of an operational and a denotational semantics for
pure dataflow. The term pure dataflow refers to dataflow nets in which the nodes are …

It is well known that a fair merge primitive leads to unbounded indeterminacy. In this paper
we show that unbounded indeterminacy cannot express a fair merge in the setting of Kahn …

We discuss the problem of finding fully abstract semantic models for nondeterministic
dataflow networks. We present the result that there exist nondeterministic networks using …

Two different formalisms for concurrency are compared and are shown to have common
foundations. The Input/Output automaton model and the theory of testing are analyzed in the …