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

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, Lecture notes in computer science, Learning Closed Signal Flow Graphs, pp. 78-95, 2024, 10.1007/978-3-031-77019-7_5.

Harald Ruess, Lecture notes in computer science, A Decision Method for First-Order Stream Logic, pp. 137-156, 2024, 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, Lecture notes in computer science, Contextual Equivalence for Signal Flow Graphs, pp. 77-96, 2020, 10.1007/978-3-030-45231-5_5, https://doi.org/10.1007/978-3-030-45231-5_5.

David Sprunger;Shin-ya Katsumata, arXiv (Cornell University), Differentiable Causal Computations via Delayed Trace, 2019, Vancouver, BC, Canada, 10.1109/lics.2019.8785670, http://arxiv.org/abs/1903.01093.

Stefan Milius;Lutz Schröder;Thorsten Wißmann, 2016, Regular Behaviours with Names, arXiv (Cornell University), 24, 5, pp. 663-701, 10.1007/s10485-016-9457-8, http://arxiv.org/abs/1607.07828.

Joost Winter;Marcello M. Bonsangue;Jan J.M.M. Rutten, 2014, Context-free coalgebras, Journal of Computer and System Sciences, 81, 5, pp. 911-939, 10.1016/j.jcss.2014.12.004, https://doi.org/10.1016/j.jcss.2014.12.004.

Joost Winter, Lecture notes in computer science, QStream: A Suite of Streams, pp. 353-358, 2013, 10.1007/978-3-642-40206-7_30.

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, arXiv (Cornell University), 89, pp. 3-18, 10.4204/eptcs.89.2.

Milad Niqui;Jan J.M.M. Rutten, 2012, Stream processing coalgebraically, Science of Computer Programming, 78, 11, pp. 2192-2215, 10.1016/j.scico.2012.07.013, https://doi.org/10.1016/j.scico.2012.07.013.

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

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

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 3153 times.

This article's PDF has been downloaded 622 times.