See this document in CiteSeerX!

Towards a Proof of the Kahn Principle for Linear Dynamic Networks (1994)  (Make Corrections)  
Arie de Bruin, Shan-Hwei Nienhuys-Cheng



  Home/Search   Context   Related

 
View or download:
cs.few.eur.nl/pub/doc/webdo...report.ps
cs.few.eur.nl/pub/d...eurcs9406.ps.Z
few.eur.nl/few/res...rfewcs9406.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fermivista.math...p.cs.few.eur.nl (more)
From:  fermivista.math...p.cs.few.eur.nl
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We consider dynamic Kahn-like data flow networks, i.e. networks consisting of deterministic processes each of which is able to expand into a subnetwork. The Kahn principle states that such networks are deterministic, i.e. that for each network we have that each execution provided with the same input delivers the same output. Moreover, the principle states that the output streams of such networks can be obtained as the smallest fixed point of a suitable operator derived from the network... (Update)

Active bibliography (related documents):   More   All
0.5:   The Algebra of Stream Processing Functions - Broy, Gheorghe (1996)   (Correct)
0.5:   Distributed Process Networks Project: Progress And Directions - Wendelborn, Webb (1999)   (Correct)
0.5:   Continuation Semantics for Prolog with Cut - de Bruin, de Vink (1989)   (Correct)

Similar documents based on text:   More   All
0.4:   Kahn's Fixed-Point Characterization for Linear Dynamic.. - Nienhuys-Cheng, de Bruin (1997)   (Correct)
0.3:   Nearly Optimal Minimax Tree Search? - Plaat, Schaeffer, Pijls, de Bruin (1994)   (Correct)
0.3:   A Minimax Algorithm Better than Alpha-Beta? No and Yes - Plaat, Schaeffer, Pijls, de .. (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ bruin-towards,
  author = "Arie de Bruin and Shan-Hwei Nienhuys-Cheng",
  title = "Towards a Proof of the Kahn Principle for Linear Dynamic Networks",
  url = "citeseer.ist.psu.edu/debruin94towards.html" }
Citations (may not include all citations):
302   The semantics of a simple language for parallel programming (context) - Kahn - 1974
107   Coroutines and networks of parallel processes (context) - Kahn, MacQueen - 1977
78   Scenarios: a model of non-determinate computation (context) - Brock, Ackerman - 1981
28   A proof of the Kahn principle for input/output automata - Lynch, Stark - 1989
21   A model and proof system for asynchronous networks (context) - Jonsson - 1985
18   An operational semantics for pure data flow (context) - Faustini - 1982
15   Nondeterministic data flow programs: how to avoid the merge .. (context) - Broy - 1988
10   A fixpoint semantics for nondeterministic data flow (context) - Staples, Nguyen - 1985
7   Some relationships between asynchronous interpreters of a da.. (context) - Arvind - 1978
7   Recursive definitions of partial functions and their computa.. (context) - Cadiou - 1972
7   Denotational semantics of nets with nondeterminism (context) - Kok - 1986
4   A straight-forward denotational semantics for nondeterminate.. (context) - Kosinski - 1978
3   Towards a complete hierarchy of compositional dataflow netwo.. - Jonsson, Kok - 1990
2   The denotational semantics of dynamic networks of processes (context) - Bohm, de Bruin - 1985
2   Experiments with continuation semantics: jumps (context) - de Bruin - 1986
1   Comparative semantics for linear arrays of communicating pro.. (context) - de Bakker, van Breugel et al. - 1993
1   mantique des processus communicants (context) - Arnold - 1981

Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.few.eur.nl.html):   More
Unifying LL and LR parsing - Pijls (1993)   (Correct)
A Theory of Game Trees, Based on Solution Trees - Pijls, de Bruin (1996)   (Correct)
Constructing Refinement Operators by Decomposing.. - Nienhuys-Cheng.. (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC