A Categorical Semantics of Signal Flow Graphs

DOI10.1007/978-3-662-44584-6_30zbMath1417.68119OpenAlexW2182286275MaRDI QIDQ3190134

Fabio Zanasi, Paweł Sobociński, Filippo Bonchi

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44584-6_30

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)

Related Items

Interacting Hopf algebras, String Diagram Rewrite Theory I: Rewriting with Frobenius Structure, Tensors, !-graphs, and non-commutative quantum structures, A Normal Form for Stateful Connectors, Categories of relations as models of quantum theory, A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations, DisCoPy: Monoidal Categories in Python, Unnamed Item, Contextual equivalence for signal flow graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Towards compositional graph theory, Confluence of Graph Rewriting with Interfaces, The algebra of partial equivalence relations, A Compositional Framework for Passive Linear Networks, Lawvere Categories as Composed PROPs, Decorated Corelations, Props in Network Theory, Universal Constructions for (Co)Relations: categories, monoidal categories, and props, The calculus of signal flow diagrams. I: Linear relations on streams., Whither semantics?, Bialgebraic foundations for the operational semantics of string diagrams, Refinement for signal flow graphs, Corelations are the prop for extraspecial commutative Frobenius monoids, String diagram rewrite theory III: Confluence with and without Frobenius