A Formal Model of Non-Determinate Dataflow Computation
Author(s)
Brock, Jarvis DeanAbstract
Almost ten years ago, Gilles Kahn used the fixed point theory of Dana Scott to define a formal and elegant model of computation for determinate dataflow graphs, networks of determinate processes communicating asynchronously through unbounded channels.
Date issued
1983-08Series/Report no.
MIT-LCS-TR-309