On Schematological Equivalence of Partially Interpreted Dataflow Networks

Alexander Rabinovich

doi:10.1006/inco.1997.2658

On Schematological Equivalence of Partially Interpreted Dataflow Networks

Alexander Rabinovich^*

^*Corresponding author for this work

School of Computer Science and AI

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	49-87
Number of pages	39
Journal	Information and Computation
Volume	138
Issue number	1
DOIs	https://doi.org/10.1006/inco.1997.2658
State	Published - 10 Oct 1997

Access to Document

10.1006/inco.1997.2658

Cite this

@article{ea756c9def6f4fa4a91b17aed8c0c47f,

title = "On Schematological Equivalence of Partially Interpreted Dataflow Networks",

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.",

author = "Alexander Rabinovich",

year = "1997",

month = oct,

day = "10",

doi = "10.1006/inco.1997.2658",

language = "אנגלית",

volume = "138",

pages = "49--87",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - On Schematological Equivalence of Partially Interpreted Dataflow Networks

AU - Rabinovich, Alexander

PY - 1997/10/10

Y1 - 1997/10/10

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0347937840

U2 - 10.1006/inco.1997.2658

DO - 10.1006/inco.1997.2658

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0347937840

SN - 0890-5401

VL - 138

SP - 49

EP - 87

JO - Information and Computation

JF - Information and Computation

IS - 1

ER -

On Schematological Equivalence of Partially Interpreted Dataflow Networks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this