Network algebra for asynchronous dataflow∗

From MaRDI portal
Publication:4375420



Abstract: We develop an algebraic theory of synchronous dataflow networks. First, a basic algebraic theory of networks, called BNA (Basic Network Algebra), is introduced. This theory captures the basic algebraic properties of networks. For synchronous dataflow networks, it is subsequently extended with additional constants for the branching connections that occur between the cells of synchronous dataflow networks and axioms for these additional constants. We also give two models of the resulting theory, the one based on stream transformers and the other based on processes as considered in process algebra.






Describes a project that uses

Uses Software






This page was built for publication: Network algebra for asynchronous dataflow∗

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375420)