A fixpoint semantics for nondeterministic data flow
Journal of the ACM (JACM)
A fully abstract semantics for data flow nets
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A proof of the Kahn principle for input/output automata
Information and Computation
A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nets of processes and data flow
Proceedings of the Fourth Annual Symposium on Logic in computer science
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
The expressive power of indeterminate dataflow primitives
Information and Computation
Handbook of logic in computer science (vol. 4)
Presheaves as transition systems
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Partial commutation and traces
Handbook of formal languages, vol. 3
A Generalized Kahn Principle for Abstract Asynchronous Networks
Proceedings of the 5th International Conference on Mathematical Foundations of Programming Semantics
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Geometry of interaction 2: deadlock-free algorithms
COLOG '88 Proceedings of the International Conference on Computer Logic
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
An Operational Semantics for Pure Dataflow
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
First-Order Axioms for Asynchrony
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Fibrational Semantics of Dataflow Networks
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
First version of a data flow procedure language
Programming Symposium, Proceedings Colloque sur la Programmation
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Nets of processes and data flow
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Compostional Relational Semantics for Indeterminate Dataflow Networks
Category Theory and Computer Science
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
A categorical model for the geometry of interaction
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Event Structure Spans for Nondeterministic Dataflow
Electronic Notes in Theoretical Computer Science (ENTCS)
Non-interleaving Semantics with Causality for Nondeterministic Dataflow
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
From Geometry of Interaction to Denotational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |
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.