The Produoidal Algebra of Process Decomposition

01/27/2023
by   Matt Earnshaw, et al.
0

We introduce the normal produoidal category of monoidal contexts over an arbitrary monoidal category. In the same sense that a monoidal morphism represents a process, a monoidal context represents an incomplete process: a piece of a decomposition, possibly containing missing parts. We characterize monoidal contexts in terms of universal properties. In particular, symmetric monoidal contexts coincide with monoidal lenses, endowing them with a novel universal property. We apply this algebraic structure to the analysis of multi-party interaction protocols in arbitrary theories of processes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2020

Comb Diagrams for Discrete-Time Feedback

The data for many useful bidirectional constructions in applied category...
research
05/11/2021

A Variety Theorem for Relational Universal Algebra

We develop an analogue of universal algebra in which generating symbols ...
research
04/25/2015

Preferential Multi-Context Systems

Multi-context systems (MCS) presented by Brewka and Eiter can be conside...
research
10/01/2021

Decomposing Monolithic Processes in a Process Algebra with Multi-actions

A monolithic process is a single recursive equation with data parameters...
research
03/29/2023

Coinductive control of inductive data types

We combine the theory of inductive data types with the theory of univers...
research
09/23/2017

The algebra of entanglement and the geometry of composition

String diagrams turn algebraic equations into topological moves that hav...
research
10/18/2019

Universal Composability is Secure Compilation

Universal composability is a framework for the specification and analysi...

Please sign up or login with your details

Forgot password? Click here to reset