A tutorial on coinductive stream calculus and signal flow graphs
From MaRDI portal
Recommendations
Cites work
- A calculus of communicating systems
- A coinductive calculus of component connectors.
- Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
- Elements of stream calculus (an extensive exercise in coinduction)
- scientific article; zbMATH DE number 3967883 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- Machines in a category
- Reo: a channel-based coordination model for component composition
- Universal coalgebra: A theory of systems
Cited in
(14)- Contextual equivalence for signal flow graphs
- Combining semilattices and semimodules
- Stream differential equations: specification formats and solution methods
- Interacting Hopf algebras
- A Hoare logic for linear systems
- Convexity via Weak Distributive Laws
- Abstract machines, optimal reduction, and streams
- Refinement for signal flow graphs
- A programming language for spatial distribution of net systems
- Formal Methods for Components and Objects
- (Co)algebraic characterizations of signal flow graphs
- An implicit function theorem for the stream calculus
- Learning closed signal flow graphs
- The calculus of signal flow diagrams. I: Linear relations on streams.
This page was built for publication: A tutorial on coinductive stream calculus and signal flow graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571208)