## Paper: A calculus of dataflow networks (at LICS 1992)

**Eugene W. Stark**

### Abstract

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

### BibTeX

@InProceedings{Stark-Acalculusofdataflow, author = {Eugene W. Stark}, title = {A calculus of dataflow networks}, booktitle = {Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science (LICS 1992)}, year = {1992}, month = {June}, pages = {125--136}, location = {Santa Cruz, CA, USA}, publisher = {IEEE Computer Society Press} }