Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values

: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous functions and geometrical solids. Furthermore, we consider communicating these exact objects among processes using protocols of a query-answer nature as introduced in our earlier work. This enables processes to provide valid approximations with certain accuracy and focusing on certain locality as demanded by the receiving processes through queries. We define domain-theoretical denotational semantics of our networks in two ways: (1) directly, i. e. by viewing the whole network as a composite process and applying the process semantics introduced in our earlier work; and (2) compositionally, i. e. by a fixed-point construction similar to that used by Kahn from the denotational semantics of individual processes in the network. The direct semantics closely corresponds to the operational semantics of the network (i.e...

• Type: Journal
• Year: 2010
• Where: JUCS
• Authors: Michal Konecný, Amin Farjudian
• Keywords: Denotational Semantics, Direct Semantics, JUCS 2010, Semantics