SearcharxivSearch

arXiv · 1710.00098

A Compositional Framework for Bond Graphs

Abstract

Electrical circuits made only of perfectly conductive wires can be seen as partitions between finite sets. These are also known as "corelations" and are the morphisms in the category $\mathrm{FinCorel}$. The two-element set has two different Frobenius monoid structures in $\mathrm{FinCorel}$. These two Frobenius monoids are related to "series" and "parallel" junctions, which are used to connect pairs of wires. We show that these Frobenius monoids interact to form a "weak bimonoid" as defined by Pastro and Street. We conjecture a presentation for the subcategory of $\mathrm{FinCorel}$ generated by the morphisms associated to these two Frobenius monoids, which we call $\mathrm{FinCorel}^{\circ}$. We are interested in "bond graphs," which are built from series and parallel junctions. Although the morphisms of $\mathrm{FinCorel}^{\circ}$ resemble bond graphs, there is not a perfect correspondence. Since bond graphs and circuits determine Lagrangian relations between symplectic vector spaces, we then consider the category of Lagrangian relations, $\mathrm{LagRel}_k$. Bond graphs pick out a subcategory $\mathrm{LagRel}_k^{\circ}$ with generating morphisms corresponding to those of $\mathrm{FinCorel}^{\circ}$. Thus we define a category $\mathrm{BondGraph}$ with generators and equations that are found in both $\mathrm{FinCorel}^{\circ}$ and $\mathrm{LagRel}_k^{\circ}$. We study the functorial semantics of $\mathrm{BondGraph}$ by giving two different functors from it to the category $\mathrm{LagRel}_k$ and a natural transformation between them. Given a bond graph, the first functor picks out a Lagrangian relation in terms of "effort" and "flow," while the second picks one out in terms of "potential" and "current." The natural transformation arises from the way that effort and flow relate to potential and current.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brandon Coya. 2017-09-29. A Compositional Framework for Bond Graphs. https://arxiv.org/abs/1710.00098

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT