• Corpus ID: 4864732

The algebra of open and interconnected systems

@article{Fong2016TheAO,
  title={The algebra of open and interconnected systems},
  author={Brendan Fong},
  journal={arXiv: Category Theory},
  year={2016}
}
  • B. Fong
  • Published 17 September 2016
  • Computer Science
  • arXiv: Category Theory
Herein we develop category-theoretic tools for understanding network-style diagrammatic languages. The archetypal network-style diagrammatic language is that of electric circuits; other examples include signal flow graphs, Markov processes, automata, Petri nets, chemical reaction networks, and so on. The key feature is that the language is comprised of a number of components with multiple (input/output) terminals, each possibly labelled with some type, that may then be connected together along… 

Figures and Tables from this paper

Picturing resources in concurrency

It is shown to axiomatise a category of open Petri nets, in the style of the connector algebras of nets with boundaries first studied by Bruni, Melgratti, Montanari and Sobociński.

A recipe for black box functors

It is argued that the category of decorating data is a good setting in which to construct any hypergraph functor, giving a new construction of Baez and Pollard's black box functor for reaction networks as an example.

A Universal Construction for (Co)Relations

It is shown how semantic categories of both relations and corelations can be characterised as colimits of simpler categories, which simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams.

Rewriting with Frobenius

A DPO rewriting formalism which is able to absorb multiple Frobenius structures, thus sensibly simplifying diagrammatic reasoning in the analysis of compound systems in a compositional, resource-sensitive manner.

1 0 D ec 2 01 8 A recipe for black box functors

It is argued that the category of decorating data is a good setting in which to construct any hypergraph functor, giving a new construction of Baez and Pollard’s black box functor for reaction networks as an example.

A Compositional Framework for Reaction Networks

This work constructs a "black-boxing" functor that sends any open dynamical system to the relation that it imposes between input and output variables in steady states, which extends earlier work on black-boxing for Markov processes.

Universal Constructions for (Co)Relations: categories, monoidal categories, and props

This paper shows how semantic categories of both relations and corelations can be characterised as colimits of simpler categories, which simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams.

Props in Network Theory

A new proof of the black-boxing theorem proved by Fong and the first author is given and a morphism of props is used to clarify the relation between circuit diagrams and the signal-flow diagrams in control theory.

A Compositional Framework for Passive Linear Networks

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

Circuits, Bond Graphs, and Signal-Flow Diagrams: A Categorical Perspective

Author(s): Coya, Brandon Hector | Advisor(s): Baez, John | Abstract: We use the framework of ``props" to study electrical circuits, signal-flow diagrams, and bond graphs. A prop is a strict symmetric
...

References

SHOWING 1-10 OF 140 REFERENCES

Full Abstraction for Signal Flow Graphs

This paper equips signal flow graphs with a structural operational semantics, and classifies the ways in which any graph can be realised -- rewritten, using the graphical theory, into an executable form where the operational behavior and the denotation coincides.

Algebras of Open Dynamical Systems on the Operad of Wiring Diagrams

This paper uses the language of operads to study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones, and defines two W-algebras, G and L, which associate semantic content to the structures in W.

Span(Graph): A Categorial Algebra of Transition Systems

We have shown that a natural algebraic structure on Span(Graph) allows the compositional specification of concurrent systems. Hoare's parallel operation appears as a derived operation in this

A categorical approach to open and interconnected dynamical systems

Using this framework, a novel structural characterisation of controllability is derived, and consequently this has the potential of providing elegant, simple, and efficient solutions to problems arising in the analysis of systems over networks, a vibrant research area at the crossing of control theory and computer science.

A Compositional Framework for Passive Linear Networks

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

Rewriting modulo symmetric monoidal structure

This paper interprets diagrams combinatorially as typed hypergraphs and establishes the precise correspondence between diagram rewriting modulo the laws of SMCs on the one hand and double pushout (DPO) rewriting of hyper graphs, subject to a soundness condition called convexity, on the other.

The operad of wiring diagrams: formalizing a graphical language for databases, recursion, and plug-and-play circuits

It is shown that wiring diagrams form the morphisms of an operad $\mcT$, capturing this self-similarity, and is moved on to show how plug-and-play devices and also recursion can be formulated in the operadic framework as well.

A compositional framework for Markov processes

It is proved that black boxing gives a symmetric monoidal dagger functor sending open detailed balanced Markov processes to open circuits made of linear resistors, and described how to “black box” an open Markov process.

Categories in Control

Control theory uses "signal-flow diagrams" to describe processes where real-valued functions of time are added, multiplied by scalars, differentiated and integrated, duplicated and deleted. These
...