Loading...
Please wait, while we are loading the content...
Similar Documents
A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks
| Content Provider | Semantic Scholar |
|---|---|
| Author | Stark, Eugene W. |
| Copyright Year | 1990 |
| Abstract | Kahn’s principle states that if each process in a dataflow network computes a continuous input/output function, then so does the entire network. Moreover, in that case the function computed by the network is the least fixed point of a continuous functional determined by the structure of the network and the functions computed by the individual processes. Previous attempts to generalize this principle in a straightforward way to “indeterminate” networks, in which processes need not compute functions, have been either too complex or have failed to give results consistent with operational semantics. In this paper, we give a simple, direct generalization of Kahn’s fixed-point principle to a large class of indeterminate dataflow networks, and we sketch a proof that results obtained by the generalized principle are in agreement with a natural operational semantics. |
| Starting Page | 157 |
| Ending Page | 174 |
| Page Count | 18 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/978-1-4471-3860-0_10 |
| Alternate Webpage(s) | http://bsd7.cs.sunysb.edu/~stark/REPORTS/gkp.ps.gz |
| Alternate Webpage(s) | http://bsd7.cs.sunysb.edu:18080/~stark/REPORTS/gkp.ps.gz |
| Alternate Webpage(s) | https://doi.org/10.1007/978-1-4471-3860-0_10 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
