Contextual equivalence for signal flow graphs
From MaRDI portal
Publication:2200814
DOI10.1007/978-3-030-45231-5_5OpenAlexW3015904789MaRDI QIDQ2200814
Fabio Zanasi, Filippo Bonchi, Robin Piedeleu, Paweł Sobociński
Publication date: 23 September 2020
Full work available at URL: https://arxiv.org/abs/2002.08874
Related Items (2)
Contextual equivalence for signal flow graphs ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monoidal computer. I: Basic computability by string diagrams
- The calculus of signal flow diagrams. I: Linear relations on streams.
- A calculus of communicating systems
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Testing equivalences for processes
- On reduction-based process semantics
- Contextual equivalence for signal flow graphs
- A tutorial on coinductive stream calculus and signal flow graphs
- Full Abstraction for Signal Flow Graphs
- Picturing Quantum Processes
- A Survey of Graphical Languages for Monoidal Categories
- A Categorical Semantics of Signal Flow Graphs
- Interacting Quantum Observables
- Rational streams coalgebraically
- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits
- Barbed bisimulation
- Categories in Control
- The Behavioral Approach to Open and Interconnected Systems
- (Co)Algebraic Characterizations of Signal Flow Graphs
- Categorical algebra
This page was built for publication: Contextual equivalence for signal flow graphs
