An event structure model for dataflow computing

Abstract

The intention of the paper is to provide "true" concurrency semantics to dynamic dataflow computing. To this end, we study the behaviour of coloured dataflow networks comparatively, incorporating such concepts as firing sequences,  data dependence graphs, partial orders and event structures. The coincidence of the above semantic notions up to an isomorphism  is established.  In particular, the classes of well-formed coloured dataflow networks and prime event structures are examined.