Hostname: page-component-7c8c6479df-nwzlb Total loading time: 0 Render date: 2024-03-29T15:56:24.657Z Has data issue: false hasContentIssue false

A relational model of non-deterministic dataflow

Published online by Cambridge University Press:  23 September 2004

THOMAS T. HILDEBRANDT
Affiliation:
IT University of Copenhagen, Denmark
PRAKASH PANANGADEN
Affiliation:
McGill University, Montreal, Canada
GLYNN WINSKEL
Affiliation:
University of Cambridge, U.K.

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.

Type
Paper
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)