|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A Generalized Kahn Principle for Abstract Asynchronous Networks | | Samson Abramsky
; | | Date: |
2 Dec 2011 | | Abstract: | Our general motivation is to answer the question: "What is a model of
concurrent computation?". As a preliminary exercise, we study dataflow
networks. We develop a very general notion of model for asynchronous networks.
The "Kahn Principle", which states that a network built from functional nodes
is the least fixpoint of a system of equations associated with the network, has
become a benchmark for the formal study of dataflow networks. We formulate a
generalized version of the Kahn Principle, which applies to a large class of
non-deterministic systems, in the setting of abstract asynchronous networks;
and prove that the Kahn Principle holds under certain natural assumptions on
the model. We also show that a class of models, which represent networks that
compute over arbitrary event structures, generalizing dataflow networks which
compute over streams, satisfy these assumptions. | | Source: | arXiv, 1112.0427 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER