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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.D. Brock and W.B. Ackerman. Scenarios: a model of non-determinate computation. In Diaz and Ramos, editors, Formalization of Programming Concepts, volume 107 of Lecture Notes in Computer Science, pages 252–259. Springer Verlag, 1982.
J. Dugundji. Topology. Allen & Bacon, 1966.
R. Engelking. General Topology. Polish Scientific Publishers, 1977.
B. Jonsson and J.N. Kok. Comparing two fully abstract dataflow models. In Proc. PARLE, Lecture Notes in Computer Science. Springer Verlag, 1989.
B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Dept. of Computer Systems, Uppsala University, Sweden, Uppsala, Sweden, 1987. Available as report DoCS 87/09, Dept. of Computer Systems, Uppsala University, Sweden.
G. Kahn. The semantics of a simple language for parallel programming. In Rosenfeld, editor, Proceedings Information Processing, pages 471–475. North-Holland, 1974.
J.N. Kok. Denotational semantics of nets with nondeterminism. In European Symposium on Programming, volume 213 of Lecture Notes in Computer Science, pages 237–249. Springer Verlag, 1986.
J.N. Kok. A fully abstract semantics for data flow nets. In Proc. PARLE, volume 259 of Lecture Notes in Computer Science, pages 351–368. Springer Verlag, 1987.
J.N. Kok. Semantic Models for Parallel Computation in Data Flow, Logic and Object-Oriented Programming. PhD thesis, Free University, Amsterdam, The Netherlands, 1989. To be defended May 11, 1989.
N.A. Lynch and E.W. Stark. A proof of the kahn principle for input/output automata. Technical Report MIT/LCS/TM349, MIT, 1988.
J. Misra. Equational reasoning about nondeterministic processes. Technical report, The University of Texas at Austin, 1989.
S.B. Nadler. Some results on multi-valued contraction mappings. In Fleischman, editor, Set-Valued Mappings, Selections and Topological Properties of 2 X, volume 171 of Lecture Notes in Mathematics, pages 64–69, 1970.
D. Park. The ‘fairness’ problem and nondeterministic computing networks. In de Bakker and van Leeuwen, editors, Foundations of Computer Science IV, Part 2, volume 159 of Mathematical Centre Tracts, pages 133–161. Mathematical Centre, Amsterdam, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-51486-4_79
Download citation
DOI: https://doi.org/10.1007/3-540-51486-4_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive