A Formal Model of Non-Determinate Dataflow Computation
| dc.contributor.advisor | Dennis, Jack B. | en_US |
| dc.contributor.author | Brock, Jarvis Dean | en_US |
| dc.date.accessioned | 2023-03-29T15:10:02Z | |
| dc.date.available | 2023-03-29T15:10:02Z | |
| dc.date.issued | 1983-08 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149585 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-309 | |
| dc.title | A Formal Model of Non-Determinate Dataflow Computation | en_US |
| dc.identifier.oclc | 10694558 |
