• DocumentCode
    3174624
  • Title

    Nonexpressibility of fairness and signaling

  • Author

    McAllester, David ; Panangaden, Prakash ; Shanbhogue, Vasant

  • Author_Institution
    Cornell Univ., Ithaca, NY, USA
  • fYear
    1988
  • fDate
    24-26 Oct 1988
  • Firstpage
    377
  • Lastpage
    386
  • Abstract
    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
  • Keywords
    programming theory; data flow primitives; expressive power; fairness; indeterminate; inequivalent; semantics; signaling; theory of process equivalence; Carbon capture and storage; Computer networks; Computer science; Law; Legal factors; Taxonomy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1988., 29th Annual Symposium on
  • Conference_Location
    White Plains, NY
  • Print_ISBN
    0-8186-0877-3
  • Type

    conf

  • DOI
    10.1109/SFCS.1988.21954
  • Filename
    21954
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3174624