TY - GEN
T1 - A calculus of dataflow networks
AU - Stark, Eugene W.
PY - 1992/6
Y1 - 1992/6
N2 - A CCS-style calculus of dataflow networks with a standard structural operational semantics is defined. A version of weak bisimulation equivalence, called buffer bisimilarity, is defined for this calculus, and its equational theory is investigated. The main result is a completeness theorem for proving equations valid under buffer bisimilarity. The axioms have a familiar, category-theoretic flavor, in which a dataflow process with m input ports and n output ports is represented by an arrow from m to n in a category whose objects are the finite ordinals.
AB - A CCS-style calculus of dataflow networks with a standard structural operational semantics is defined. A version of weak bisimulation equivalence, called buffer bisimilarity, is defined for this calculus, and its equational theory is investigated. The main result is a completeness theorem for proving equations valid under buffer bisimilarity. The axioms have a familiar, category-theoretic flavor, in which a dataflow process with m input ports and n output ports is represented by an arrow from m to n in a category whose objects are the finite ordinals.
UR - https://www.scopus.com/pages/publications/0026879981
M3 - Conference contribution
AN - SCOPUS:0026879981
SN - 0818627352
T3 - Proceedings - Symposium on Logic in Computer Science
SP - 125
EP - 136
BT - Proceedings - Symposium on Logic in Computer Science
PB - Publ by IEEE
T2 - Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science
Y2 - 22 June 1992 through 25 June 1992
ER -