Algebraic specifications for dataflow computations design

Dataflow networks are a well-known mathematical tool extensively used for representing, analyzing and modeling concurrent computing systems and their software. Formal dataflow models reported in the literature may be divided in two groups – static and dynamic. Static models admit at most one token on an arc. This assumption severely limits the possibilities of concurrency. Dynamic models are free from this restriction due to program code copying and token coloring.