From Data Flow Networks to process Algebras

We have defined a transformation γ from data flow networks to process algebras specifications. The behaviour of γ(N) in terms of the interleaving of observable actions corresponds to the traces of network N in the traces model. This opens the possibility of applying the tools and the theory developed for the process algebras to analyse data flow networks. An important field is verification where the tools of the process algebras can be significantly applied to prove networks equivalence