Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Data flow networks are a model of concurrent computation. They consist of a collection of concurrent asynchronous processes which communicate by sending data over FIFO channels.   study the algebraic structure of the data flow networks and base their semantics on stream processing functions. Our algebraic theory is based on the  calculus of flownomials . With an  additive  (or  cantorian ) interpretation the calculus gives a unified presentation of the classical algebraic models for control structures, that is, regular algebra and iteration theories. The kernel of the calculus is an equational axiomatization called basic network algebra (BNA) for flow graphs modulo graph isomorphism.  show that the algebra of stream processing functions called   SPF   (used for deterministic networks) and the algebra of sets of stream processing functions called   P  SPF   (used for nondeterministic networks) are BNA algebras. Actually they give a  multiplicative  (or  cartesian ) interpretation of the calculus of flownomials. As a byproduct this shows that both semantic models are compositional. This means the semantics of a network may be described in terms of the semantics of its components. (As it is ll known this is not true for the input–output relational semantics of nondeterministic networks.)  also identify additional axioms satisfied by the branching constants in these two algebraic theories. For the deterministic case  study in addition the coarser equivalence relation on networks given by the input–output behavior and provide a correct and complete axiomatization.
['Manfred Broy', 'Gheorghe Stefănescu']
I am writing a research paper on a idea The algebra of stream processing functions
[{"from": "human", "value": "I am writing a research paper on a idea The algebra of stream processing functions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Data flow networks are a model of concurrent computation. They consist of a collection of concurrent asynchronous processes which communicate by sending data over FIFO channels.   study the algebraic structure of the data flow networks and base their semantics on stream processing functions. Our algebraic theory is based on the  calculus of flownomials . With an  additive  (or  cantorian ) interpretation the calculus gives a unified presentation of the classical algebraic models for control structures, that is, regular algebra and iteration theories. The kernel of the calculus is an equational axiomatization called basic network algebra (BNA) for flow graphs modulo graph isomorphism.  show that the algebra of stream processing functions called   SPF   (used for deterministic networks) and the algebra of sets of stream processing functions called   P  SPF   (used for nondeterministic networks) are BNA algebras. Actually they give a  multiplicative  (or  cartesian ) interpretation of the calculus of flownomials. As a byproduct this shows that both semantic models are compositional. This means the semantics of a network may be described in terms of the semantics of its components. (As it is ll known this is not true for the input\u2013output relational semantics of nondeterministic networks.)  also identify additional axioms satisfied by the branching constants in these two algebraic theories. For the deterministic case  study in addition the coarser equivalence relation on networks given by the input\u2013output behavior and provide a correct and complete axiomatization."}]