A relational model of non-deterministic dataflow Export

@article{citeulike:5283859, abstract = {We recast dataflow in a modern categorical light using profunctors as a generalisation of relations. The well-known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fits with the view of categories of models for concurrency and the general treatment of bisimulation they provide. In particular, it fits with the recent categorical formulation of feedback using traced monoidal categories. The payoffs are: (1) explicit relations to existing models and semantics, especially the usual axioms of monotone IO automata are read off from the definition of profunctors; (2) a new definition of bisimulation for dataflow, the proof of the congruence of which benefits from the preservation properties associated with open maps; and (3) a treatment of higher-order dataflow as a biproduct, essentially by following the geometry of interaction programme.}, address = {New York, NY, USA}, author = {Hildebrandt, Thomas T. and Panangaden, Prakash and Winskel, Glynn}, citeulike-article-id = {5283859}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1024685}, citeulike-linkout-1 = {http://dx.doi.org/10.1017/S0960129504004293}, doi = {10.1017/S0960129504004293}, issn = {0960-1295}, journal = {Mathematical. Structures in Comp. Sci.}, keywords = {category-theory, dataflow, monoidal-categories, non-determinism, relations, symmetric-monoidal-categories, traced-symmetric-monoidal-categories}, number = {5}, pages = {613--649}, posted-at = {2009-09-13 16:43:32}, priority = {5}, publisher = {Cambridge University Press}, title = {A relational model of non-deterministic dataflow}, url = {http://dx.doi.org/10.1017/S0960129504004293}, volume = {14}, year = {2004} }

TY - JOUR ID - citeulike:5283859 L3 - citeulike-article-id:5283859 N2 - We recast dataflow in a modern categorical light using profunctors as a generalisation of relations. The well-known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fits with the view of categories of models for concurrency and the general treatment of bisimulation they provide. In particular, it fits with the recent categorical formulation of feedback using traced monoidal categories. The payoffs are: (1) explicit relations to existing models and semantics, especially the usual axioms of monotone IO automata are read off from the definition of profunctors; (2) a new definition of bisimulation for dataflow, the proof of the congruence of which benefits from the preservation properties associated with open maps; and (3) a treatment of higher-order dataflow as a biproduct, essentially by following the geometry of interaction programme. IS - 5 JF - Mathematical. Structures in Comp. Sci. SN - 0960-1295 AD - New York, NY, USA EP - 649 TI - A relational model of non-deterministic dataflow PB - Cambridge University Press VL - 14 SP - 613 KW - category-theory KW - dataflow KW - monoidal-categories KW - non-determinism KW - relations KW - symmetric-monoidal-categories KW - traced-symmetric-monoidal-categories AU - Hildebrandt, Thomas AU - Panangaden, Prakash AU - Winskel, Glynn PY - 2004/// UR - http://dx.doi.org/10.1017/S0960129504004293 ER -