Rational streams coalgebraically

J. J. M. M. Rutten

doi:10.2168/LMCS-4(3:9)2008

J. J. M. M. Rutten - Rational streams coalgebraically

lmcs:1164 - Logical Methods in Computer Science, September 19, 2008, Volume 4, Issue 3 - https://doi.org/10.2168/LMCS-4(3:9)2008

Rational streams coalgebraicallyArticle

Authors: J. J. M. M. Rutten

We study rational streams (over a field) from a coalgebraic perspective.
Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams: by finite dimensional linear systems; by finite stream circuits; by finite weighted stream automata; and by finite dimensional subsystems of the set of streams.

https://doi.org/10.2168/LMCS-4(3:9)2008

Source: arXiv.org:0807.4073

Volume: Volume 4, Issue 3

Secondary volumes: Selected Papers of the 2nd Conference on Algebra and Coalgebra in Computer Science (CALCO 2007)

Published on: September 19, 2008

Imported on: December 20, 2007

Keywords: Computer Science - Logic in Computer Science, F.1.1, G.1.0

Licence: arXiv.org - Non-exclusive license to distribute

Classifications

Mathematics Subject Classification 2020¹

Sources:

[1] zbMATH Open.

Bibliographic References

12 Documents citing this article

Ekaterina Piotrovskaya;Leo Lobski;Fabio Zanasi, 2024, Learning Closed Signal Flow Graphs, Lecture notes in computer science, pp. 78-95, 10.1007/978-3-031-77019-7_5.

Harald Ruess, 2024, A Decision Method for First-Order Stream Logic, Lecture notes in computer science, pp. 137-156, 10.1007/978-3-031-63501-4_8, https://doi.org/10.1007/978-3-031-63501-4_8.

Filippo Bonchi;Robin Piedeleu;Paweł Sobociński;Fabio Zanasi, 2020, Contextual Equivalence for Signal Flow Graphs, Lecture notes in computer science, pp. 77-96, 10.1007/978-3-030-45231-5_5, https://doi.org/10.1007/978-3-030-45231-5_5.

David Sprunger;Shin-ya Katsumata, 2019, Differentiable Causal Computations via Delayed Trace, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1-12, 10.1109/lics.2019.8785670.

Stefan Milius;Lutz Schröder;Thorsten Wißmann, 2016, Regular Behaviours with Names, Applied Categorical Structures, 24, 5, pp. 663-701, 10.1007/s10485-016-9457-8.

Joost Winter;Marcello M. Bonsangue;Jan J.M.M. Rutten, 2014, Context-free coalgebras, Radboud Repository (Radboud University), 81, 5, pp. 911-939, 10.1016/j.jcss.2014.12.004, https://hdl.handle.net/2066/141357.

Joost Winter, 2013, QStream: A Suite of Streams, CWI's Institutional Repository (Centrum Wiskunde & Informatica), pp. 353-358, 10.1007/978-3-642-40206-7_30, https://ir.cwi.nl/pub/22291.

Stefan Milius;Marcello M. Bonsangue;Robert S.R. Myers;Jurriaan Rot, 2013, Rational Operational Models, Electronic Notes in Theoretical Computer Science, 298, pp. 257-282, 10.1016/j.entcs.2013.09.017, https://doi.org/10.1016/j.entcs.2013.09.017.

Marcello M. Bonsangue;Stefan Milius;Jurriaan Rot, 2012, On the specification of operations on the rational behaviour of systems, Electronic Proceedings in Theoretical Computer Science, 89, pp. 3-18, 10.4204/eptcs.89.2, https://doi.org/10.4204/eptcs.89.2.

Milad Niqui;Jan J.M.M. Rutten, 2012, Stream processing coalgebraically, Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands, 78, 11, pp. 2192-2215, 10.1016/j.scico.2012.07.013, https://ir.cwi.nl/pub/22125.

Stefan Milius, 2010, A Sound and Complete Calculus for Finite Stream Circuits, 2010 25th Annual IEEE Symposium on Logic in Computer Science, 10.1109/lics.2010.11.

Michele Boreale, 2009, Weighted Bisimulation in Linear Algebraic Form, Lecture notes in computer science, pp. 163-177, 10.1007/978-3-642-04081-8_12.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 4504 times.

This article's PDF has been downloaded 864 times.