A tutorial on coinductive stream calculus and signal flow graphs

This paper presents an application of coinductive stream calculus to signal flow graphs. In comparison to existing approaches, which are usually based on Z-transforms (a discrete version of Laplace transforms) and transfer functions, the model presented in these notes is very elementary. The formal treatment of flow graphs is interesting because it deals with two fundamental phenomena in the theory of computation: memory (in the form of register or delay elements) and infinite behaviour (in the form of feedback).

[1]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[2]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[3]  Jan Rutten.  The differential calculus of bitstreams , 2004 .

[4]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[5]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[6]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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

[8]  Michael A. Arbib,et al.  Algebraic Approaches to Program Semantics , 1986, Texts and Monographs in Computer Science.

[9]  Farhad Arbab,et al.  A Coinductive Calculus of Component Connectors , 2002, WADT.

[10]  Jan J. M. M. Rutten.  Elements of Stream Calculus (An Extensive Exercise in Coinduction) , 2001, MFPS.

[11]  M. Arbib,et al.  Machines in a category , 1980 .