Network algebra for asynchronous dataflow∗
Jan Aldert Bergstra, Cornelis A. Middelburg, G.H. Ştef[acaron]nescu · International Journal of Computer Mathematics · 1997
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.