AN ALGEBRA OF DATAFLOW NETWORKS

Eugene W. Stark · Fundamenta Informaticae · 1995

This paper describes an algebraic framework for the study of dataflow networks, which form a paradigm for concurrent computation in which a collection of concurrently and asynchronously executing processes communicate by sending messages between port

Read the paper · More papers on PaperTik