Sampling, Splitting and Merging in Coinductive Stream Calculus

We study various operations for partitioning, projecting and merging streams of data. These operations are motivated by their use in dataflow programming and the stream processing languages. We use the framework of stream calculus and stream circuits for defining and proving properties of such operations using behavioural differential equations and coinduction proof principles. We study the invariance of certain well patterned classes of streams, namely rational and algebraic streams, under splitting and merging. Finally we show that stream circuits extended with gates for dyadic split and merge are expressive enough to realise some non-rational algebraic streams, thereby going beyond ordinary stream circuits.

[1]  Gilles Christol,et al.  Ensembles Presque Periodiques k-Reconnaissables , 1979, Theor. Comput. Sci..

[2]  Jeffrey Shallit,et al.  Automatic Sequences by Jean-Paul Allouche , 2003 .

[3]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[4]  RH Rudolf Mak,et al.  Design and performance analysis of data-independent stream processing systems , 2008 .

[5]  Grigore Rosu,et al.  CIRC : A Circular Coinductive Prover , 2007, CALCO.

[6]  Jan J. M. M. Rutten.  Rational Streams Coalgebraically , 2008, Log. Methods Comput. Sci..

[7]  Jan J. M. M. Rutten,et al.  A tutorial on coinductive stream calculus and signal flow graphs , 2005, Theor. Comput. Sci..

[8]  C. Mauduit,et al.  Substitutions in dynamics, arithmetics, and combinatorics , 2002 .

[9]  Tarmo Uustalu,et al.  Comonadic Notions of Computation , 2008, CMCS.

[10]  M. Ziegler.  Volume 152 of Graduate Texts in Mathematics , 1995 .

[11]  Manfred Broy,et al.  The algebra of stream processing functions , 2001, Theor. Comput. Sci..

[12]  J. Shallit,et al.  Automatic Sequences: Contents , 2003 .

[13]  Jan J. M. M. Rutten,et al.  A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[14]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[15]  Herbert S. Wilf,et al.  Generating functionology , 1990 .

[16]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[17]  Jack L. Rosenfeld.  Information processing 74 : proceedings of IFIP Congress 74 , 1974 .

[18]  N. Wiener,et al.  Systems Theory , 2018, Formation Control of Multi-Agent Systems.

[19]  Alan Cobham,et al.  On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.

[20]  Alfred J. van der Poorten,et al.  Automatic sequences. Theory, applications, generalizations , 2005, Math. Comput..

[21]  Jan J. M. M. Rutten,et al.  Algebraic Specification and Coalgebraic Synthesis of Mealy Automata , 2006, FACS.

[22]  Jiho Kim,et al.  Coinductive Properties of Causal Maps , 2008, AMAST.

[23]  R. Lathe.  Phd by thesis , 1988, Nature.