An iterative metric fully abstract semantics for nondeterministic dataflow (extended abstract)

  • Joost N. Kok
Communications

DOI: 10.1007/3-540-51486-4_79

Part of the Lecture Notes in Computer Science book series (LNCS, volume 379)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Joost N. Kok
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtthe Netherlands

Personalised recommendations