An iterative metric fully abstract semantics for nondeterministic dataflow (extended abstract)
- First Online:
- Cite this paper as:
- Kok J.N. (1989) An iterative metric fully abstract semantics for nondeterministic dataflow (extended abstract). In: Kreczmar A., Mirkowska G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg
We study a fully abstract semantics for (nondeterministic) dataflow based on streams. Kahn formulated a restriction for nodes such that the history model is compositional and can be obtained by an iteration procedure. The main result of this paper is such a restriction for the stream model. We use metric topology to formulate the restriction and to show that the stream model for this restricted set can be obtained by iteration.
Unable to display preview. Download preview PDF.