In: Computers and Artificial Intelligence, Vol. 18, No. 1, pages 73-93. 1999.
Abstract: The intention of the paper is to provide `true' concurrency semantics to dynamic dataflow computing. To this end, we study the behavior of colored 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 colored dataflow networks and prime event structures are examined.
Keywords: Petri nets, dataflow computing, event structures, token coloring, true concurrency.