A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A general Kahn principle for abstract asynchronous networks
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Handbook of logic in computer science (vol. 3)
Advances in the dataflow computational model
Parallel Computing - Special Anniversary issue
A relational model of non-deterministic dataflow
Mathematical Structures in Computer Science
Event Structure Spans for Nondeterministic Dataflow
Electronic Notes in Theoretical Computer Science (ENTCS)
Full abstraction for nondeterministic dataflow networks
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Hi-index | 0.01 |
We present a denotational model of nondeterministic dataflow in which an explicit notion of causality is introduced. We define a set of labelled flows over a set of fixed channels and two orders which induce cpo structures. Labelled flows are based on a conflict relation which allows to express several behaviours (configurations) at once. A netflow is a continuous function over configurations used to represent a dataflow network. We use a form of Galois connection in which such a function is the upper adjoint to correlate the possible outputs with their causes. The feedback operation is defined using a fixed point construction. Russell's example is used to show how this formal approach solves causal anomalies of nondeterministic dataflow.