On schematological equivalence of partially interpreted dataflow networks

DOI10.1006/INCO.1997.2658zbMath0895.68046OpenAlexW2050028265MaRDI QIDQ1373139

Alexander Rabinovich

Publication date: 27 September 1998

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

Full work available at URL: https://semanticscholar.org/paper/8255e748c1705ad670fb5b5a169943b4f38347f6

zbMATH Keywords

dataflow nets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computer system organization (68M99)

Cites Work

• Theory of program structures: Schemes, semantics, verification
• A fully abstract trace model for dataflow and asynchronous networks
• A proof of the Kahn principle for input/output automata
• On schematological equivalence of dataflow networks
• A generalized Kahn Principle for abstract asynchronous networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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