article

A tutorial on coinductive stream calculus and signal flow graphs

Author:

J. J. M. M. RuttenAuthors Info & Claims

Theoretical Computer Science, Volume 343, Issue 3

Pages 443 - 481

https://doi.org/10.1016/j.tcs.2005.06.019

Published: 17 October 2005 Publication History

Abstract

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).

References

[1]

{1} P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt, D.E. Ryeheard, P. Dybjer, A.M. Pitts, A. Poigne (Eds.), Proc. Category Theory and Computer Science, Lecture Notes in Computer Science, Vol. 389, Springer, Berlin, 1989, pp. 357-365.

Digital Library

Google Scholar

[2]

{2} F. Arbab, Reo: a channel-based coordination model for component composition, Math. Struct. Comput. Sci. 14 (2004) 329-366.

Digital Library

Google Scholar

[3]

{3} F. Arbab, J.J.M.M. Rutten, A coinductive calculus of component connectors, in: M. Wirsing, D. Pattinson, R. Hennicker (Eds.), Proc. WADT 2002, Lecture Notes in Computer Science, Vol. 2755, Springer, Berlin, 2003, pp. 35-56.

Google Scholar

[4]

{4} M.A. Arbib, E.G. Manes, Machines in a category, J. Pure Appl. Algebra 19 (1980) 9-20.

Crossref

Google Scholar

[5]

{5} CMCS'98-'02, Proc. Internat. Workshop Series Coalgebraic Methods in Computer Science, Electronic Notes in Theoretical Computer Science, Vols. 11, 19, 33, 44, 65, Elsevier Science B.V., Amsterdam.

Google Scholar

[6]

{7} B.P. Lahti, Signal Processing & Linear Systems, Oxford University Press, Oxford, 1998.

Google Scholar

[7]

{8} E.G. Manes, M.A. Arbib, Algebraic Approaches to Program Semantics, Texts and Monographs in Computer Science, Springer, Berlin, 1986.

Digital Library

Google Scholar

[8]

{9} R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer, Berlin, 1980.

Digital Library

Google Scholar

[9]

{10} D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. 5th GI Conference, Lecture Notes in Computer Science, Vol. 104, Springer, Berlin, 1981, pp. 167-183.

Digital Library

Google Scholar

[10]

{11} J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Theoret. Comput. Sci. 249 (1) (2000) 3-80.

Digital Library

Google Scholar

[11]

{12} J.J.M.M. Rutten, Elements of stream calculus (an extensive exercise in coinduction) in: S. Brooks, M. Mislove (Eds.), Proc. MFPS 2001, Electronic Notes in Theoretical Computer Science, Vol. 45, Elsevier Science Publishers, Amsterdam, 2001, pp. 1-66.

Google Scholar

[12]

{13} J.J.M.M. Rutten, The differential calculus of bitstreams, Report SEN-E0403, CWI, 2004.

Google Scholar

[13]

{14} J. van Benthem, Modal correspondence theory, Ph.D. Thesis, University of Amsterdam, Amsterdam, 1976.

Google Scholar

Cited By

View all

Piotrovskaya ELobski LZanasi F(2024)Learning Closed Signal Flow GraphsTheoretical Aspects of Computing – ICTAC 202410.1007/978-3-031-77019-7_5(78-95)Online publication date: 25-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-77019-7_5
Bonchi FSobociński PZanasi F(2017)The Calculus of Signal Flow Diagrams IInformation and Computation10.1016/j.ic.2016.03.002252:C(2-29)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.ic.2016.03.002
Bonchi FSobocinski PZanasi F(2015)Full Abstraction for Signal Flow GraphsACM SIGPLAN Notices10.1145/2775051.267699350:1(515-526)Online publication date: 14-Jan-2015
https://dl.acm.org/doi/10.1145/2775051.2676993
Show More Cited By

Index Terms

A tutorial on coinductive stream calculus and signal flow graphs
1. Theory of computation
  1. Logic
  2. Semantics and reasoning
    1. Program reasoning
      1. Program specifications
    2. Program semantics

Recommendations

Coinductive big-step operational semantics

Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating evaluations. We ...
Coinductive Axiomatization of Recursive Type Equality and Subtyping

We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via ...
Coinductive Verification of Program Optimizations Using Similarity Relations

Formal verification methods have gained increased importance due to their ability to guarantee system correctness and improve reliability. Nevertheless, the question how proofs are to be formalized in theorem provers is far from being trivial, yet very ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 343, Issue 3

Formal methods for components and objects

17 October 2005

246 pages

ISSN:0304-3975

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 17 October 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Piotrovskaya ELobski LZanasi F(2024)Learning Closed Signal Flow GraphsTheoretical Aspects of Computing – ICTAC 202410.1007/978-3-031-77019-7_5(78-95)Online publication date: 25-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-77019-7_5
Bonchi FSobociński PZanasi F(2017)The Calculus of Signal Flow Diagrams IInformation and Computation10.1016/j.ic.2016.03.002252:C(2-29)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.ic.2016.03.002
Bonchi FSobocinski PZanasi F(2015)Full Abstraction for Signal Flow GraphsACM SIGPLAN Notices10.1145/2775051.267699350:1(515-526)Online publication date: 14-Jan-2015
https://dl.acm.org/doi/10.1145/2775051.2676993
Bonchi FSobocinski PZanasi FRajamani SWalker D(2015)Full Abstraction for Signal Flow GraphsProceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages10.1145/2676726.2676993(515-526)Online publication date: 14-Jan-2015
https://dl.acm.org/doi/10.1145/2676726.2676993
Niqui MRutten J(2013)Stream processing coalgebraicallyScience of Computer Programming10.1016/j.scico.2012.07.01378:11(2192-2215)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.scico.2012.07.013
Arthan RMartin UOliva P(2013)A Hoare logic for linear systemsFormal Aspects of Computing10.1007/s00165-011-0180-925:3(345-363)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1007/s00165-011-0180-9
Endrullis JHendriks DBakhshi R(2012)On the complexity of equivalence of specifications of infinite objectsACM SIGPLAN Notices10.1145/2398856.236455147:9(153-164)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2398856.2364551
Endrullis JHendriks DBakhshi RThiemann PFindler R(2012)On the complexity of equivalence of specifications of infinite objectsProceedings of the 17th ACM SIGPLAN international conference on Functional programming10.1145/2364527.2364551(153-164)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1145/2364527.2364551
Niqui MRutten J(2010)Sampling, splitting and merging in coinductive stream calculusProceedings of the 10th international conference on Mathematics of program construction10.5555/1886619.1886639(310-330)Online publication date: 21-Jun-2010
https://dl.acm.org/doi/10.5555/1886619.1886639
Rutten J(2007)Coalgebraic foundations of linear systemsProceedings of the 2nd international conference on Algebra and coalgebra in computer science10.5555/1770730.1770761(425-446)Online publication date: 20-Aug-2007
https://dl.acm.org/doi/10.5555/1770730.1770761
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Coinductive big-step operational semantics

Coinductive Axiomatization of Recursive Type Equality and Subtyping

Coinductive Verification of Program Optimizations Using Similarity Relations

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations