An event structure model for dataflow computing

The intention of the paper is to provide 'true' concurrency semantics to dy namic dataflow computing. To this end, we study the behaviour of coloured d ataflow networks comparatively, incorporating such concepts as firing seque nces, data dependence graphs, partial orders and event structures. The coin cidence of the above semantic notions up to an isomorphism is established. In particular, the classes of well-formed coloured dataflow networks and pr ime event structures are examined.