A Compositional Framework for Passive Linear Networks
From MaRDI portal
Abstract: Passive linear networks are used in a wide variety of engineering applications, but the best studied are electrical circuits made of resistors, inductors and capacitors. We describe a category where a morphism is a circuit of this sort with marked input and output terminals. In this category, composition describes the process of attaching the outputs of one circuit to the inputs of another. We construct a functor, dubbed the "black box functor", that takes a circuit, forgets its internal structure, and remembers only its external behavior. Two circuits have the same external behavior if and only if they impose same relation between currents and potentials at their terminals. The space of these currents and potentials naturally has the structure of a symplectic vector space, and the relation imposed by a circuit is a Lagrangian linear relation. Thus, the black box functor goes from our category of circuits to the category of symplectic vector spaces and Lagrangian linear relations. We prove that this functor is We prove that this functor is symmetric monoidal and indeed a hypergraph functor. We assume the reader is familiar with category theory, but not with circuit theory or symplectic linear algebra.
Recommendations
- scientific article; zbMATH DE number 916408
- Theory and synthesis of linear passive time-invariant networks
- On linear passive complementarity systems
- Controllability of linear passive network behaviors
- Passive network synthesis. An approach to classification
- Synthesis of General Linear Networks
- Linear Passive Networks With Ideal Switches: Consistent Initial Conditions and State Discontinuities
- scientific article; zbMATH DE number 4045458
- Compositional Modeling and Analysis of Multi-Hop Control Networks
- Compositional Abstraction for Networks of Control Systems: A Dissipativity Approach
Cites work
- A categorical semantics of signal flow graphs
- A compositional framework for Markov processes
- A compositional framework for reaction networks
- A Lagrangian representation of tangles
- A student's guide to symplectic spaces, Grassmannians and Maslov index
- Braided tensor categories
- Calculating Colimits Compositionally
- Categories for the Practising Physicist
- Categories in control
- Corelations are the prop for extraspecial commutative Frobenius monoids
- Dagger compact closed categories and completely positive maps (extended abstract)
- Decorated Corelations
- Decorated cospans
- Existence and uniqueness of diffusions on finitely ramified self-similar fractals
- scientific article; zbMATH DE number 3656300 (Why is no real title available?)
- scientific article; zbMATH DE number 3494283 (Why is no real title available?)
- scientific article; zbMATH DE number 1522866 (Why is no real title available?)
- scientific article; zbMATH DE number 2154221 (Why is no real title available?)
- scientific article; zbMATH DE number 3268843 (Why is no real title available?)
- scientific article; zbMATH DE number 2222245 (Why is no real title available?)
- In control, almost from the beginning until the day after tomorrow
- On the mathematical foundations of electrical circuit theory
- Physics, Topology, Logic and Computation: A Rosetta Stone
- Props in Network Theory
- Symplectic geometry
- Synthesis of a Finite Two-terminal Network whose Driving-point Impedance is a Prescribed Function of Frequency
- The Behavioral Approach to Open and Interconnected Systems
- The geometry of tensor calculus. I
Cited in
(34)- Generalized relations in linguistics \& cognition
- Towards a unified framework for decomposability of processes
- Hypergraph categories
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
- A string diagrammatic axiomatisation of finite-state automata
- Corelations are the prop for extraspecial commutative Frobenius monoids
- A recipe for black box functors
- Open systems in classical mechanics
- Spans of cospans in a topos
- Spans of cospans
- Decorated Corelations
- Props in Network Theory
- Coarse-graining open Markov processes
- On the Use of Linear Combination in PWCP-Nets
- scientific article; zbMATH DE number 7453976 (Why is no real title available?)
- String diagrams for regular logic (extended abstract)
- DisCoPy: monoidal categories in Python
- Structured cospans
- On the geometry and algebra of networks with state
- Homotopy composition of cospans
- A bicategory of decorated cospans
- A compositional framework for reaction networks
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams
- A survey of categorical properties of \(\mathbb{L}\)-fuzzy relations
- String diagrammatic electrical circuit theory
- Graphical piecewise-linear algebra
- Bidirectional processes -- in category theory, physics, engineering, \dots
- A graphical calculus for Lagrangian relations
- String diagrams for strictification and coherence
- On compositions of (L-fuzzy) automata: a categorical approach
- Operads for complex system design specification, analysis and synthesis
- Compositional separation of control flow and data flow
- The calculus of signal flow diagrams. I: Linear relations on streams.
- Graphical quadratic algebra: a complete calculus for convex optimisation and Gaussian probability
This page was built for publication: A Compositional Framework for Passive Linear Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4555338)
