Show simple item record

dc.contributor.authorPanangaden, Prakashen_US
dc.contributor.authorShanbhogue, Vasanten_US
dc.contributor.authorStark, Eugene W.en_US
dc.date.accessioned2007-04-23T17:39:43Z
dc.date.available2007-04-23T17:39:43Z
dc.date.issued1989-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1055en_US
dc.identifier.urihttps://hdl.handle.net/1813/6855
dc.description.abstractThe class of monotone input/output automata has been shown in the authors' previous work to be a useful operational model for a dataflow-style networks of communicating processes. An interesting class of problems arising from this model are those that concern the relationship between the input/output behavior of automata to the structure of their transition graphs. In this paper, we restrict our attention to the subclass of determinate automata, which compute continuous functions, and we characterize classes of determinate automata that compute: (1) the class of functions that are stable in the sense of Berry, and (2) the class of functions that are sequential in the sense of Kahn and Plotkin.en_US
dc.format.extent3149868 bytes
dc.format.extent650876 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.titleStabilitly and Sequentiality in Dataflow Networksen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics