Nonexpressibility of Fairness and Signaling
McAllester, David; Panangaden, Prakash
In this paper, we establish new expressiveness results for indeterminate dataflow primitives. We consider choice primitives with three differing fairness assumptions and show that they are strictly inequivalent in expressive power. We also show that the ability to announce choices enhances the expressive power of two of the primitives. These results are proved using a very crude semantics and thus apply in any reasonable theory of process equivalence.
computer science; technical report
Previously Published As