On Schematological Equivalence of Dataflow Networks

Alexander Rabinovich*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We consider the problem of determining when two dataflow networks with uninterpreted nodes always have the same input-output behavior. We define a set of behavior-preserving transformations on networks and show that this set is "schematologically complete"; i.e., networks have the same input-output behavior under all interpretations if and only if they can be transformed into isomorphic networks. As a by product, we obtain a polynomial algorithm for deciding schematological equivalence of dataflow networks.

Original languageEnglish
Pages (from-to)154-167
Number of pages14
JournalInformation and Computation
Issue number2
StatePublished - 1 Feb 1996


Dive into the research topics of 'On Schematological Equivalence of Dataflow Networks'. Together they form a unique fingerprint.

Cite this