An event structure model for dataflow computing
I. B. Virbitskaite
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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.
Publié le : 2012-01-26
Classification:  
@article{cai612,
     author = {I. B. Virbitskaite},
     title = {An event structure model for dataflow computing},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai612}
}

I. B. Virbitskaite. An event structure model for dataflow computing. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai612/