TY - GEN

T1 - Nets and data flow interpreters

AU - Rabinovich, A.

AU - Trakhtenbrot, B. A.

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024929496&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0024929496

SN - 0818619546

T3 - Proc Fourth Ann Symp Logic Comput Sci

SP - 164

EP - 174

BT - Proc Fourth Ann Symp Logic Comput Sci

A2 - Anon, null

PB - Publ by IEEE

T2 - Proceedings of the Fourth Annual Symposium on Logic in Computer Science

Y2 - 5 June 1989 through 8 June 1989

ER -