Refinement for signal flow graphs

DOI10.4230/LIPICS.CONCUR.2017.24MaRDI QIDQ5111638zbMATHOpenAlexFDO

Authors Filippo Bonchi, Joshua Holland, Dusko Pavlovic, Paweł Sobociński

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.CONCUR.2017.24

zbMATH Keywords

refinementoperational semanticssignal flow graphsstring diagramssymmetric monoidal inequality theory

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1065062 (Why is no real title available?)
• A Hoare logic for linear systems
• A basic algebra of stateless connectors
• A categorical semantics of signal flow graphs
• A tutorial on coinductive stream calculus and signal flow graphs
• Boolean Algebras with Operators. Part I
• Cartesian bicategories. I
• Categories in control
• Coherence for compact closed categories
• Connector algebras for C/E and P/T nets' interactions
• 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
• Full abstraction for signal flow graphs
• Interacting Hopf algebras
• Interacting Quantum Observables
• Interacting bialgebras are Frobenius
• Nets, relations and linking diagrams
• The Behavioral Approach to Open and Interconnected Systems
• The calculus of signal flow diagrams. I: Linear relations on streams.
• Towards an algebraic theory of Boolean circuits.

Cited in

(10)

• scientific article; zbMATH DE number 35407 (Why is no real title available?)
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure
• The calculus of signal flow diagrams. I: Linear relations on streams.
• String diagrammatic electrical circuit theory
• A categorical semantics of signal flow graphs
• Open diagrams via coend calculus
• Symmetric monoidal categories with attributes
• Simplification of signal flow graphs
• String diagram rewrite theory. I: Rewriting with Frobenius structure
• scientific article; zbMATH DE number 7649898 (Why is no real title available?)

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)