A Process Algebra for the Operational Semantics of Static Data Flow Networks

摘要

An algebra of communicating processes is used to provide an operational semantics of data flow networks with a static number of nodes and channels. A data flow network is modeled as a system of processes communicating by hand shaking. Nodes and channels are treated on equal footing: in both cases their semantics are derived as the solution of a fixed point equation in the process algebra.