(Co)Algebraic Characterizations of Signal Flow Graphs
From MaRDI portal
Publication:5418958
DOI10.1007/978-3-319-06880-0_6zbMath1407.68183MaRDI QIDQ5418958
Henning Basold, Helle Hvid Hansen, Marcello M. Bonsangue, Jan J. M. M. Rutten
Publication date: 2 June 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.452.2308
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
18B20: Categories of machines, automata
Related Items
The calculus of signal flow diagrams. I: Linear relations on streams., Contextual equivalence for signal flow graphs, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subsequential transducers: a coalgebraic perspective
- Universal coalgebra: A theory of systems
- A fixpoint theorem for complete categories
- A tutorial on coinductive stream calculus and signal flow graphs
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Rational streams coalgebraically
- A coinductive calculus of streams
- Coalgebraic Logic and Synthesis of Mealy Machines
- On Flow Graph Solutions of Linear Algebraic Equations
- Inverses of Linear Sequential Circuits
- Computation of the Transition Matrix of a Linear Sequential Circuit