Refinement for signal flow graphs
From MaRDI portal
Publication:5111638
DOI10.4230/LIPIcs.CONCUR.2017.24zbMath1442.68125OpenAlexW2759078539MaRDI QIDQ5111638
Joshua Holland, Filippo Bonchi, Paweł Sobociński, Dusko Pavlovic
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2017.24
operational semanticsrefinementsignal flow graphsstring diagramssymmetric monoidal inequality theory
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Hopf algebras and their applications (16T05) Monoidal categories, symmetric monoidal categories (18M05)
Related Items (6)
String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Open Diagrams via Coend Calculus ⋮ Symmetric Monoidal Categories with Attributes ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Interacting Hopf algebras
- A Hoare logic for linear systems
- Fibonacci's \textit{Liber abaci}. A translation into modern English of Leonardo Pisano's \textit{Book of calculation}. Transl. from the Latin and with an introduction, notes and bibliography by L. E. Sigler
- The calculus of signal flow diagrams. I: Linear relations on streams.
- A basic algebra of stateless connectors
- Cartesian bicategories. I
- Coherence for compact closed categories
- Towards an algebraic theory of Boolean circuits.
- A tutorial on coinductive stream calculus and signal flow graphs
- Full Abstraction for Signal Flow Graphs
- Connector algebras for C/E and P/T nets' interactions
- Nets, Relations and Linking Diagrams
- A Categorical Semantics of Signal Flow Graphs
- Interacting Quantum Observables
- Categories in Control
- The Behavioral Approach to Open and Interconnected Systems
- Interacting Bialgebras Are Frobenius
- Boolean Algebras with Operators. Part I
This page was built for publication: Refinement for signal flow graphs
