TY - JOUR
T1 - On Schematological Equivalence of Dataflow Networks
AU - Rabinovich, Alexander
PY - 1996/2/1
Y1 - 1996/2/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/0347053097
U2 - 10.1006/inco.1996.0012
DO - 10.1006/inco.1996.0012
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0347053097
SN - 0890-5401
VL - 124
SP - 154
EP - 167
JO - Information and Computation
JF - Information and Computation
IS - 2
ER -