Title :
A calculus of dataflow networks
Author :
Stark, Eugene W.
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
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
Keywords :
equivalence classes; formal logic; programming theory; buffer bisimilarity; category theory; completeness theorem; dataflow networks; equational theory; equivalence; Calculus; Carbon capture and storage; Communication channels; Computer languages; Computer networks; Computer science; Concurrent computing; Equations; History; IP networks;
Conference_Titel :
Logic in Computer Science, 1992. LICS '92., Proceedings of the Seventh Annual IEEE Symposium on
Conference_Location :
Santa Cruz, CA
Print_ISBN :
0-8186-2735-2
DOI :
10.1109/LICS.1992.185527
