Abstract
A fixed point semantics for nondeterministic data flow is introduced which refines and extends work of Park (1983). It can be seen also as an extension to the general case of Kahn's (1974) successful fixed point semantics for deterministic data flow. An associativity result for network construction is proved which shows that anomalies such as those of Brock and Ackerman do not arise in this semantics. The semantics is shown to be extensional, in the natural sense that nondeterministic processes which induce identical input-output relations in all contexts are equal.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
