Abstract
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.
∗This paper is an abridged version of [1]. The full version covers synchronous dataflow networks as well.
†Partially supported by ESPRIT BRA 8533 (NADA) and ESPRIT BRA 6454 (CONFER).
∗∗On leave (1996-1997) at United Nations University, International Institute for Software Technology, P.O. Box 3058, Macau; [email protected].
‡Partially supported by HMC cooperation network ERBCHRXCT930406 (EXPRESS).
∗This paper is an abridged version of [1]. The full version covers synchronous dataflow networks as well.
†Partially supported by ESPRIT BRA 8533 (NADA) and ESPRIT BRA 6454 (CONFER).
∗∗On leave (1996-1997) at United Nations University, International Institute for Software Technology, P.O. Box 3058, Macau; [email protected].
‡Partially supported by HMC cooperation network ERBCHRXCT930406 (EXPRESS).
Notes
∗This paper is an abridged version of [1]. The full version covers synchronous dataflow networks as well.
†Partially supported by ESPRIT BRA 8533 (NADA) and ESPRIT BRA 6454 (CONFER).
∗∗On leave (1996-1997) at United Nations University, International Institute for Software Technology, P.O. Box 3058, Macau; [email protected].
‡Partially supported by HMC cooperation network ERBCHRXCT930406 (EXPRESS).