A tutorial on coinductive stream calculus and signal flow graphs
From MaRDI portal
Publication:2571208
DOI10.1016/j.tcs.2005.06.019zbMath1077.68032MaRDI QIDQ2571208
Publication date: 1 November 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.019
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Abstract machines, optimal reduction, and streams, A Programming Language for Spatial Distribution of Net Systems, (Co)Algebraic Characterizations of Signal Flow Graphs, Interacting Hopf algebras, A Hoare logic for linear systems, The calculus of signal flow diagrams. I: Linear relations on streams., Contextual equivalence for signal flow graphs, Combining semilattices and semimodules, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Machines in a category
- A calculus of communicating systems
- Universal coalgebra: A theory of systems
- Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
- Reo: a channel-based coordination model for component composition
- Elements of Stream Calculus
- Recent Trends in Algebraic Development Techniques