Computer Science – Logic in Computer Science
Scientific paper
2011-12-02
Computer Science
Logic in Computer Science
25 pages. Published in the Proceedings of the Symposium on Mathematical Foundations of Programming Language Semantics, Springe
Scientific paper
10.1007/BFb0040252
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.
No associations
LandOfFree
A Generalized Kahn Principle for Abstract Asynchronous Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Generalized Kahn Principle for Abstract Asynchronous Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalized Kahn Principle for Abstract Asynchronous Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-140066