Refinement for signal flow graphs
DOI10.4230/LIPICS.CONCUR.2017.24zbMATH Open1442.68125OpenAlexW2759078539MaRDI QIDQ5111638FDOQ5111638
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
Recommendations
- Simplification of signal flow graphs
- Improved decomposition of signal transition graphs
- scientific article; zbMATH DE number 35407
- Full abstraction for signal flow graphs
- Formal Methods for Components and Objects
- Sensitivity minimization in signal-flow graphs
- Contextual equivalence for signal flow graphs
- Algorithms for symbolic reduction of signal flow graphs.
- The signal flow graph method of goal programming
refinementoperational semanticssignal flow graphsstring diagramssymmetric monoidal inequality theory
Hopf algebras and their applications (16T05) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monoidal categories, symmetric monoidal categories (18M05)
Cites Work
- Interacting Quantum Observables
- Boolean Algebras with Operators. Part I
- Cartesian bicategories. I
- Coherence for compact closed categories
- A tutorial on coinductive stream calculus and signal flow graphs
- Full abstraction for signal flow graphs
- Interacting Hopf algebras
- A Categorical Semantics of Signal Flow Graphs
- The Behavioral Approach to Open and Interconnected Systems
- Interacting Bialgebras Are Frobenius
- 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
- A basic algebra of stateless connectors
- Towards an algebraic theory of Boolean circuits.
- Title not available (Why is that?)
- A Hoare logic for linear systems
- Connector algebras for C/E and P/T nets' interactions
- Categories in Control
- The calculus of signal flow diagrams. I: Linear relations on streams.
- Nets, Relations and Linking Diagrams
Cited In (8)
- Simplification of signal flow graphs
- Symmetric Monoidal Categories with Attributes
- String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
- Open Diagrams via Coend Calculus
- Title not available (Why is that?)
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Refinement for signal flow graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111638)
