A fully abstract semantics for data flow nets

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


Two semantic models for data flow nets are given.

The first model is an intuitive, operational model. This model has an important drawback: it is not compositional. An example given in [Brock & Ackerman 1981] shows the non-compositionality of our model. There exist two nets that have the same semantics, but when they are placed in a specific context, the semantics of the resulting nets differ.

The second one is obtained by adding information to the first model. The amount of information is enough to make it compositional. Moreover, we show that we have added the minimal amount of information to make the model compositional: the second model is fully abstract with respect to the equivalence generated by the first model.

To be more specific: the first model describes the semantics a data flow net as a function from (tuples of) sequences of tokens to sets of (tuples of) sequences of tokens. The second one maps a data flow net to a function from (tuples of) infinite sequences of finite words to sets of (tuples of) infinite sequences of finite words.


Normal Form Operational Semantic Infinite Sequence Output Line Empty Word 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    [Abramsky 1983], S. Abramsky, On Semantic Foundations for Applicative Multiprogramming, in Proc. 10th ICALP (J. Diaz ed.), LNCS 154, Springer, 1983, pp. 1–14.Google Scholar
  2. 2.
    [Abramsky 1984], S. Abramsky, Reasoning About Concurrent Systems, in Distributed Computing (F.B. Chambers, D.A. Duce, G.P. Jones eds.), 1984.Google Scholar
  3. 3.
    [Arnold 1981], A. Arnold, Semantique des Processus Communicants, RAIRO 15 (2), 1981, pp. 103–109.Google Scholar
  4. 4.
    [Back & Mannila 1982], R.J. Back, N. Mannila, A Refinement of Kahn's Semantics to Handle Nondeterminism and Communication, in Proc. ACM Symp. on Distributed Comp., Ottawa, 1982, pp.111–120.Google Scholar
  5. 5.
    [de Bakker et al 1985], J.W. de Bakker, J.-J.Ch. Meyer, J. Zucker, Bringing Color into the Semantics of Nondeterministic Data Flow, Preprint, Centre for Mathematics and Computer Science, 1985.Google Scholar
  6. 6.
    [Bergstra & Klop 1983], J. Bergstra, J.W. Klop, Process Algebra for the Operational Semantics of Static Data Flow Networks, Techn. Report Mathematical Centre IW 222/83, Amsterdam, 1983.Google Scholar
  7. 7.
    [Boussinot 1982], Boussinot, Proposition de semantique denotationelle pour des reseaux de processus avec operateur de melange equitable, TCS 18, 1982, pp. 173–206.CrossRefGoogle Scholar
  8. 8.
    [Brock & Ackerman 1981], J.D. Brock, W.B. Ackerman, Scenarios: A Model of Nondeterminate Computation, in Proc. Formalization of Programming Concepts (J. Diaz, J. Ramos eds.), LNCS 107, Springer, 1981, pp.252–259.Google Scholar
  9. 9.
    [Broy 1983], M. Broy, Fixed Point Theory for Communication and Concurrency, in Formal Description of Programming Concepts-II (D. Bjørner ed.), North-Holland, Amsterdam, 1983, pp. 125–148.Google Scholar
  10. 10.
    [Broy 1984], M. Broy, Nondeterministic Data Flow Programs: How to avoid the Merge Anomaly, preprint, Fakultät für Mathematik und Informatik, Universität Passau, 1984.Google Scholar
  11. 11.
    [Broy 1985], M. Broy, Extensional Behavior of Concurrent, Nondeterministic, Communicating Systems, in Control Flow and Data Flow: Concepts of Distributed Programming (M. Broy ed.), pp. 229–277.Google Scholar
  12. 12.
    [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
  13. 13.
    [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
  14. 14.
    [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
  15. 15.
    [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
  16. 16.
    [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.), LNCS 197, Springer, 1985, pp. 479–496.Google Scholar
  17. 17.
    [Kok 1986], J.N. Kok, Denotational Semantics of Nets with Nondeterminism, in Proceedings ESOP 1986, LNCS 213, Springer, pp. 237–250.Google Scholar
  18. 18.
    [Kosinski 1978], P.R. Kosinski, A Straightforward Denotational Semantics for Nondeterminate Data Flow Programs, in Proc. 5th ACM POPL, 1978, pp. 214–221.Google Scholar
  19. 19.
    [Nadler 1970], S.B. Nadler, Some Results on Multi-Valued Contraction Mappings, in SetValued Mappings, Selections and Topological Properties of 2X (W.M. Fleischman ed.), Lecture Notes in Mathematics, pp. 64–69, 1970.Google Scholar
  20. 20.
    [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
  21. 21.
    [Staples & Nguyen 1985], J. Staples, V.L. Nguyen, A Fixpoint Semantics for Nondeterministic Dataflow, Journal of the ACM, 32 (2), 1985, pp. 411–445.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

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

Personalised recommendations