On Schematological Equivalence of Partially Interpreted Dataflow Networks

Alexander Rabinovich*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We provide a schematologically complete set of transformations for partially interpreted dataflow nets. This paper extends our results in (Inform. and Comput. 124 (1996), 154-167), where a schematologically complete set of transformations was provided for the nets which consist only of uninterpreted nodes and the results for partially interpreted nets were announced without proofs.

Original languageEnglish
Pages (from-to)49-87
Number of pages39
JournalInformation and Computation
Volume138
Issue number1
DOIs
StatePublished - 10 Oct 1997

Fingerprint

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

Cite this