Nonexpressibility of fairness and signaling

Expressiveness results for indeterminate data flow primitives are established. Choice primitives with three differing fairness assumptions are considered, and it is shown that they are strictly inequivalent in expressive power. It is also shown 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 will thus apply in any reasonable theory of process equivalence.<<ETX>>

[1]  Nancy A. Lynch,et al.  A Proof of the Kahn Principle for Input/Output Automata , 1989, Inf. Comput..

[2]  Samson Abramsky,et al.  On Semantic Foundations for Applicative Multiprogramming , 1983, ICALP.

[3]  Eugene W. Stark,et al.  Concurrent transition system semantics of process networks , 1987, POPL '87.

[4]  Ralph-Johan Back,et al.  A Continuous Semantics for Unbounded Nondeterminism , 1983, Theor. Comput. Sci..

[5]  Eugene W. Stark,et al.  Concurrent Transition Systems , 1989, Theor. Comput. Sci..

[6]  Prakash Panangaden,et al.  Stability and Sequentiality in Dataflow Networks , 1990, ICALP.

[7]  Ernst-Rüdiger Olderog,et al.  Proof Rules and Transformations Dealing with Fairness , 1983, Sci. Comput. Program..

[8]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[9]  Grzegorz Rozenberg,et al.  Theory of Traces , 1988, Theor. Comput. Sci..

[10]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[11]  Krzysztof R. Apt,et al.  Countable nondeterminism and random assignment , 1986, JACM.

[12]  Lutz Priese,et al.  Fairness , 1988, Bull. EATCS.

[13]  James R. Russell,et al.  On oraclizable networks and Kahn's principle , 1989, POPL '90.

[14]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[15]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[16]  Eugene W. Stark.  Semaphore primitives and starvation-free mutual exclusion , 1982, JACM.

[17]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[18]  Manfred Broy,et al.  Fixed PointTheory for Communication and Concurrency , 1982, Formal Description of Programming Concepts.

[19]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[20]  Jean-Jacques Lévy,et al.  Full abstraction for sequential languages : The states of the art , 1983 .

[21]  Robert M. Keller,et al.  Denotational Models for Parallel Programs with Indeterminate Operators , 1977, Formal Description of Programming Concepts.

[22]  Prakash Panangaden,et al.  Computations, Residuals, and the POwer of Indeterminancy , 1988, ICALP.

[23]  Prakash Panangaden.  McCarthy's Amb Cannot Implement Fair Merge , 1988, FSTTCS.

[24]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.