Network algebra for synchronous dataflow

We develop an algebraic theory of synchronous dataflow networks. First, a basic algebraic theory of networks, called BNA (Basic Network Algebra), is introduced. This theory captures the basic algebraic properties of networks. For synchronous dataflow networks, it is subsequently extended with additional constants for the branching connections that occur between the cells of synchronous dataflow networks and axioms for these additional constants. We also give two models of the resulting theory, the one based on stream transformers and the other based on processes as considered in process algebra.

[1]  Calvin C. Elgot,et al.  Realization of Events by Logical Nets , 1958, JACM.

[2]  Jan A. Bergstra,et al.  Network algebra with demonic relation operators , 1995 .

[3]  Gheorghe Stefănescu,et al.  On Flowchart Theories: Part II. The Nondeterministic Case , 1987, Theor. Comput. Sci..

[4]  Jan A. Bergstra,et al.  On sequential composition, action prefixes and process prefix , 1994, Formal Aspects of Computing.

[5]  A P.W. Bohm,et al.  Dataflow computation , 1983 .

[6]  Gheorghe Stefanescu,et al.  Towards a new algebraic foundation of flowchart scheme theory , 1990 .

[7]  Joost N. Kok,et al.  A Fully Abstract Semantics for Data Flow Nets , 1987, PARLE.

[8]  Jan A. Bergstra,et al.  Network algebra for asynchronous dataflow , 1997, Int. J. Comput. Math..

[9]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[10]  C. C. Elgot.  Monadic Computation And Iterative Algebraic Theories , 1982 .

[11]  Manfred Broy,et al.  Nondeterministic Data Flow Programs: How to Avoid the Merge Anomaly , 1988, Sci. Comput. Program..

[12]  J. A. Bergstra,et al.  Some simple calculations in relative discrete time process algebra , 1995 .

[13]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

[14]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[15]  Manfred Broy,et al.  Functional specification of time-sensitive communicating systems , 1993, TSEM.

[16]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[17]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[18]  Bengt Jonsson,et al.  A fully abstract trace model for dataflow and asynchronous networks , 1994, Distributed Computing.

[19]  Hans Mulder,et al.  Computable processes , 1994 .

[20]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .

[21]  James R. Russell,et al.  Full abstraction for nondeterministic dataflow networks , 1989, 30th Annual Symposium on Foundations of Computer Science.

[22]  Jan A. Bergstra,et al.  Network algebra for synchronous and asynchronous dataflow , 1994 .