A Categorical Semantics of Signal Flow Graphs

DOI10.1007/978-3-662-44584-6_30zbMath1417.68119MaRDI 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

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

18C50: Categorical semantics of formal languages

Related Items

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