A Formal Model of Non-Determinate Dataflow Computation
Name
MIT-LCS-TR-309.pdf
Size
495.16 KB
Format
Adobe PDF
Checksum (MD5)
78a3bd8254b4b15aea118295316541f1
Author(s)
Brock, Jarvis Dean
Advisor(s)
Dennis, Jack B.
Date Issued
August 1983
Series/Report no.
MIT-LCS-TR-309
Abstract
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.
Persistent DSpace Link