We investigate the relationship between three kinds of interpreted nets: nets of processes, nets of relations and nets of functions (or of sets of functions). The respective semantic definitions are based on three fundamental constructs: synchronization, strong conjunction and least fixed point operator. In this way we relate notions from concurrency, logic and domain theory and explain phenomena like Kahn’s Principle and the Brock-Ackerman anomaly for data flow networks. We advocate the analysis of these phenomena on the abstract level of processes, relations and functions over arbitrary F-domains instead of dealing only with concrete models of stream processing. In this way we get results which subsume and improve previous results on data flow networks and may be applied also to other formalisms describing distributed systems.