On schematological equivalence of dataflow networks

DOI10.1006/INCO.1996.0012MaRDI QIDQ1917073zbMATH OpenOpenAlexFDO

Authors Alexander Rabinovich

Publication date 3 July 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1996.0012

zbMATH Keywords

dataflow networkspolynomial algorithm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• On schematological equivalence of partially interpreted dataflow networks
• scientific article; zbMATH DE number 3924115
• Structural and behavioural equivalences of networks
• scientific article; zbMATH DE number 177839

Cited in

(13)

• Structural and behavioural equivalences of networks
• On schematological equivalence of partially interpreted dataflow networks
• scientific article; zbMATH DE number 3924115 (Why is no real title available?)
• scientific article; zbMATH DE number 3928354 (Why is no real title available?)
• scientific article; zbMATH DE number 3930383 (Why is no real title available?)
• scientific article; zbMATH DE number 177839 (Why is no real title available?)
• scientific article; zbMATH DE number 1305005 (Why is no real title available?)
• scientific article; zbMATH DE number 517054 (Why is no real title available?)
• scientific article; zbMATH DE number 742725 (Why is no real title available?)
• scientific article; zbMATH DE number 1759408 (Why is no real title available?)
• Equivalence and generalization in a layered network model
• Implementation and Application of Automata
• Higher order dataflow schemas

This page was built for publication: On schematological equivalence of dataflow networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917073)