Denotational semantics of nets with nondeterminism

  • Joost N. Kok
Part of the Lecture Notes in Computer Science book series (LNCS, volume 213)


We define a topological framework for streams of traces. With this approach Kahn's method generalizes to nets with bounded nondeterminism. We consider fixpoints of multivalued functions. We have a standard fixed point theorem, which can be used to model feed back loops. These fixed points can also be obtained by iteration. We give a general syntax of nets and see how we can analyze them in our streamframework. We show how to avoid the Brock-Ackerman and Keller anomalies. We are able to model the fair merge, which is a continuous function in our framework, and delay along lines. We prove a lemma that says that the order in which we connect nodes in our networks does not matter. If we have nets with nodes with unbounded nondeterminism, we can still use these fixpoints, but we do lose in our topological framework our iteration theorem.


Cauchy Sequence Multivalued Function Operational Semantic Output Line Delay Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Abramsky 1983]
    A. Abramsky, On Semantic Foundations for Applicative Multiprogramming, Proc. 10th ICALP, (J.Diaz ed.), Barcelona, LNCS 154, Springer, 1983, pp. 1–14.Google Scholar
  2. [Arnold 1981]
    A. Arnold, Semantique des Processus Communicants, RAIRO 15 (2), 1981, pp.103–109.Google Scholar
  3. [Back & Mannila 1982]
    R.J.Back, N. Mannila, A Refinement of Kahn's Semantics to Handle Nondeterminism and Communication, Proc. ACM Symp. on Distributed Comp., Ottawa, 1982, pp. 111–120.Google Scholar
  4. [de Bakker et al 1985]
    J.W. de Bakker, J.-J.Ch. Meyer, J. Zucker, Bringing Color in the Semantics of Nondeterministic Dataflow, Preprint, Centre fo Mathematics and Computer Science, 1985.Google Scholar
  5. [de Bakker & Kok 1985]
    J.W. de Bakker, J.N. Kok, Towards a Topological Treatment of Streams and Functions on Streams, Proc. 12th ICALP, (W. Brauer ed.), Nafplion, LNCS 194, 1985, pp. 140–149.Google Scholar
  6. [Bergstra & Klop 1983]
    J. Bergstra, J.W. Klop, Process Algebra for the Operational Semantics of Static Dataflow Networks, Techn. Report Mathematical Centre IW 222/83, Amsterdam, 1983.Google Scholar
  7. [Boussinot 1982]
    Boussinot, Proposition de semantique denotationelle pour des reseaux de processus avec operateur de melange equitable, TCS 18, 1982, pp. 173–206.Google Scholar
  8. [Brock & Ackerman 1981]
    J.D. Brock, W.B. Ackerman, Scenarios: A Model of Non-determinate Computation, in Proc. Formalization of Language Concepts, (J. Diaz, J. Ramos eds.), LNCS 107, Springer, 1981, pp. 252–259.Google Scholar
  9. [Broy 1983]
    M. Broy, Fixed Point Theory for Communication and Concurrency, in: Formal Description of Programming Concepts-II, (Bjorner ed.), North-Holland, Amsterdam, 1983, pp. 125–148.Google Scholar
  10. [Broy 1984]
    M. Broy, Nondeterministic Data Flow Programs: How to avoid the Merge Anomaly, preprint, Fakultat fur Mathematik und Informatik, Universitat Passau, 1984.Google Scholar
  11. [Dugundji 1966]
    J. Dugundji, Topology, Allen and Bacon Rockleigh, N.J. 1966.Google Scholar
  12. [Engelking 1977]
    R. Engelking, General topology, Polish Scientific Publishers 1977.Google Scholar
  13. [Faustini 1982]
    A.A. Faustini, An Operational Semantics for Pure Dataflow, in: Proc. 9th ICALP, (M. Nielsen, E.M. Schmidt, eds.), LNCS 140, Springer, 1982, pp. 212–224.Google Scholar
  14. [Hahn 1948]
    H. Hahn, Reelle Funktionen, Chelsea, New York, 1948.Google Scholar
  15. [Kahn 1974]
    G. Kahn, The Semantics of a Simple Language for Parallel Programming, in: Proc. IFIP74, North-Holland, Amsterdam, 1977, pp. 993–998.Google Scholar
  16. [Kahn & MacQueen 1977]
    G. Kahn, D.B. MacQueen, Coroutines and Networks of Parallel Processes, in Proc. IFIP 1977, North-Holland, Amsterdam, 1977, pp. 993–998.Google Scholar
  17. [Keller 1978]
    R.M. Keller, Denotational Models for Parallel Programs with Indeterminate Operators, in: Formal Description of Programming Concepts, (E.J. Neuhold ed.), North-Holland, Amsterdam, 1977, pp. 337–366.Google Scholar
  18. [Keller & Panangaden 1985]
    R.M. Keller, P. Panangaden, Semantics of Networks Containing Indeterminate Operators, in: Seminar on Concurrency, Carnegie-Mellon University, (S.D. Brookes, A.W. Roscoe, G. Winskel eds.), Lecture Notes in Computer Science 197, pp. 479–496, 1985.Google Scholar
  19. [Kosinski 1978]
    P.R. Kosinski, A Straightforward Denotational Semantics for Nondeterminate Data Flow Programs, in: 5th ACM POPL, 1978, pp. 214–182.Google Scholar
  20. [Michael 1951]
    E. Michael, Topologies on spaces of subsets, Trans. AMS 71 (1951), pp12–182.Google Scholar
  21. [Nadler 1970]
    Nadler, S.B., Some Results on Multi-Valued Contraction Mappings, in Set-Valued Mappings, Selections and Topological Properties of 2X, (W.M. Fleischman ed), Lecture Notes in Mathematics, pp. 64–69, 1970.Google Scholar
  22. [Nivat 1979]
    M. Nivat, Infinite words, infinite trees, infinite computations, Foundations of Computer Science III. 2, Mathematical Centre Tracts 109 (1979) 3–52.Google Scholar
  23. [Park 1983]
    D. Park, The Fairness Problem and Nondeterministic Computing Networks, in: Foundations of Computer Science IV.2, (J.W. de Bakker, J. van Leeuwen eds), Mathematical Centre Tracts 159, Amsterdam, 1983, pp. 133–161.Google Scholar
  24. [Staples & Nguyen 1985]
    J. Staples, V.L. Nguyen, A Fixpoint Semantics for Nondeterministic Dataflow, Journal of the ACM, april 1985, 32(2), 1985, pp. 411–445.Google Scholar
  25. [Wadge 1981]
    W.W. Wadge, An extensional Treatment of Dataflow Deadlock, in Theoretical Computer Science 13 (1981), pp. 3–15, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Joost N. Kok
    • 1
  1. 1.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations