Nets and data flow interpreters

A. Rabinovich*, B. A. Trakhtenbrot

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations


The authors investigate and compare two ways of specifying stream relations (in particular, stream functions). The first uses relational programs, i.e., netlike program schemes in which the signature primitives are interpreted as relations over a given CPO. No stream domains are assumed; semantics is in fixed-point style. The second is through data flow nets, i.e., nets whose nodes are interpreted as processes (computational stations). The authors prove the existence of an adequate data flow interpreter for relational programs over all relations (not only functional) and (essentially) its uniqueness. When dealing with functions the interpreter is modular and obeys the Kahn principle. Analyzing the deviations from Kahn's principle, the authors identify two kinds of anomalies. The first (meagerness anomaly) is caused by the defect of the used processes (computational stations) and holds in fact for arbitrary (even for very simple functional) input-output behaviors. The second (ambiguity anomaly) is rooted in the semantics of relational nets over arbitrary CPO (and not specifically over stream domains). It is unavoidable in any extension beyond functional behaviors.

Original languageEnglish
Title of host publicationProc Fourth Ann Symp Logic Comput Sci
Editors Anon
PublisherPubl by IEEE
Number of pages11
ISBN (Print)0818619546
StatePublished - 1989
EventProceedings of the Fourth Annual Symposium on Logic in Computer Science - Pacific Grove, CA, USA
Duration: 5 Jun 19898 Jun 1989

Publication series

NameProc Fourth Ann Symp Logic Comput Sci


ConferenceProceedings of the Fourth Annual Symposium on Logic in Computer Science
CityPacific Grove, CA, USA


Dive into the research topics of 'Nets and data flow interpreters'. Together they form a unique fingerprint.

Cite this