Coalgebraic foundations of linear systems

Authors:
J. J. M. M. Rutten
Affiliations:
CWI and Vrije Universiteit Amsterdam
Venue:
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Year:
2007

Citing 6
Cited 2

A polynomial approach to linear algebra

A polynomial approach to linear algebra
Automata, Languages, and Machines

Automata, Languages, and Machines
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
Behavioural differential equations: a coinductive calculus of streams, automata, and power series

Theoretical Computer Science
A tutorial on coinductive stream calculus and signal flow graphs

Theoretical Computer Science - Formal methods for components and objects
Bisimilar linear systems

Automatica (Journal of IFAC)

Calculating Invariants as Coreflexive Bisimulations

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Quantitative Kleene coalgebras

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the final coalgebras of streams and causal stream functions.