Abstract

Dataflow networks are a well-known mathematical tool extensively used for modelling and analyzing concurrent computing systems and their software. A few formal dataflow models reported in the literature may be amalgamated in two groups-static and dynamic. Static models allow at most one token on an arc. This assumption severely limits the amount of concurrency that is possible. Dynamic models are free from this restriction by program code copying and token colouring.

File
Issue
Pages
101-115