A semantic model of data flow networks based on process algebras

Data flow networks are a paradigm for concurrent computations in which a collection of parallel processes communicate asynchronously. For data flow many compositional semantics models have been defined, however, it is extremely complex to reason about their semantic behaviour. To perform the semantic analysis of data flow networks, we define a transformation from data flow to specifications in the process algebras formalism which preserves the traces of the networks. The main contribution of the paper lies in the possibility of applying the theory and tools developed for the process algebras formalism in the analysis of data flow networks. Keywords Parallel Programs: formal program development methodologies, specification and verification; Parallel Programming Languages: Semantics