Show simple item record

dc.contributor.authorMcAllester, Daviden_US
dc.contributor.authorPanangaden, Prakashen_US
dc.date.accessioned2007-04-23T17:42:01Z
dc.date.available2007-04-23T17:42:01Z
dc.date.issued1989-02en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-972en_US
dc.identifier.urihttps://hdl.handle.net/1813/6888
dc.description.abstractIn 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.en_US
dc.format.extent4125798 bytes
dc.format.extent702804 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleNonexpressibility of Fairness and Signalingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics