A Relational Model of Non-Deterministic Dataflow

Disclaimers: i'm struggling to grok half of the words in the paper, so it might not be as interesting as i think it is. I searched but didn't find it explicitly mentioned before on LtU.

The abstract of the paper says:

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.

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

less mumbo jumbo introduction

"A fundamental dichotomy in concurrency is the distinction between asynchronous communication and synchronous communication. In the present paper we unify the analysis of these situations..."