Advertisement

An operational semantics for pure dataflow

  • A. A. Faustini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

In this paper we prove the equivalence of an operational and a denotational semantics for pure dataflow. The term pure dataflow refers to dataflow nets in which the nodes are functional (i.e. the output history is a function of the input history only) and the arcs are unbounded fifo queues. Gilles Kahn gave a method for the representation of a pure dataflow net as a set of equations; one equation for each arc in the net. Kahn stated, and we prove, that the operational behaviour of a pure dataflow net is exactly described by the least fixed point solution to the net's associated set of equations.

In our model we do not require that nodes be sequential nor deterministic, not even the functional nodes. As a consequence our model has a claim of being completely general.

Our proof of the Kahn Principle makes use of two player infinite games of perfect information. Infinite games turn out to be an extremely useful tool for defining and proving results about operational semantics.

Keywords

Internal State Operational Semantic Input Buffer History Function Denotational Semantic 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [O]
    Adams D. A computation model with dataflow sequencing Ph.D Thesis (Stanford University 1968) Technical report No. CS 117Google Scholar
  2. [1]
    Arnold Andre Semantique des processus communicants RAIRO Vol 15 No 2 1981Google Scholar
  3. [2]
    Arvind, Kim P and Gostelow, Kim P. Some relationships between asynchronous interpreters of a dataflow language. Formal Description of Programming Concepts St. Andrews N.B., Canada 1977zbMATHGoogle Scholar
  4. [3]
    E.A. Ashcroft & W.Wadge Structured Lucid Theory of Computation, Report No33 University of Warwick, CoventryGoogle Scholar
  5. [4]
    Kahn Gilles The semantics of a simple language for parallel programming. IFIPS 74Google Scholar
  6. [5]
    R.M. Karp & R.E. Miller Properties of a model for Parallel Computations: Determinacy, Termination, Queueing SIAM J. Applied Math XIV (Nov 1966) pp1390–411.MathSciNetCrossRefGoogle Scholar
  7. [6]
    Z. Manna Mathematical Theory of Computation (Mc Graw-Hill 1974)Google Scholar
  8. [7]
    A.A.Faustini The Equivalence Between an Operatational and a denotational semantics for pure dataflow Ph.D Thesis (In preparation) University of Warwick, CoventryGoogle Scholar
  9. [8]
    M. Davis Infinite games of perfect information Advances in Game theory Annals of Mathematical Studies V. 52 Princeton University Press Princeton N.J. pp 85–101Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • A. A. Faustini
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryUK

Personalised recommendations