Name
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1080/00207169708804599 | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS |
Keywords | DocType | Volume |
dataflow networks, network algebra, process algebra, asynchronous dataflow, feedback, merge anomaly, history models, oracle based models, trace models | Journal | 65 |
Issue | ISSN | Citations |
1-2 | 0020-7160 | 3 |
PageRank | References | Authors |
0.45 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan A. Bergstra | 1 | 1445 | 140.42 |
| Cornelis A. Middelburg | 2 | 487 | 49.21 |
| G. H. Stefanescu | 3 | 3 | 0.45 |