Full Abstraction for Nondeterministic Dataflow Networks
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
We discuss the problem of finding fully abstract semantic models for nondeterministic dataflow networks. We present the result that there exist nondeterministic networks using only bounded choice for which the input-output relation is not compositional. We go on to show that the trace semantics is fully abstract for all nondeterministic as well as deterministic networks.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1989-06
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1022
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report