Network algebra is proposed as a uniform algebraic framework for the
description and analysis of dataflow networks.
An equational theory of networks, called BNA (Basic Network Algebra), is
presented.
BNA, which is essentially a part of the algebra of flownomials, captures
the basic algebraic properties of networks.
For asynchronous dataflow networks, additional constants and axioms
are given; and a corresponding process algebra model is introduced.
This process algebra model is compared with previous models for
asynchronous dataflow.
Note: This paper is an abridged version of
Network algebra for synchronous and
asynchronous dataflow.
The full version covers synchronous dataflow networks as well.
Preprint available here.