The expressive power of indeterminate dataflow primitives

https://doi.org/10.1016/0890-5401(92)90043-FGet rights and content
Under a Creative Commons license
open archive

Abstract

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 inequivalent, forms of unbounded indeterminacy. In particular, we show that the well-known fair merge primitive cannot be expressed with just unbounded indeterminacy. Our proofs are based on a simple trace semantics and on identifying properties of the behaviors of networks that are invariant under network composition. The properties we consider in this paper are all generalizations of monotonicity.

Cited by (0)

Present address: School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7.

Present address: Department of Computer Science, Wichita State University, Wichita, Kansas 67208.