The operad of temporal wiring diagrams: formalizing a graphical language for discretetime processes
Abstract
We investigate the hierarchical structure of processes using the mathematical theory of operads. Information or material enters a given process as a stream of inputs, and the process converts it to a stream of outputs. Output streams can then be supplied to other processes in an organized manner, and the resulting system of interconnected processes can itself be considered a macro process. To model the inherent structure in this kind of system, we define an operad $\mathcal{W}$ of black boxes and directed wiring diagrams, and we define a $\mathcal{W}$algebra $\mathcal{P}$ of processes (which we call propagators, after Radul and Sussman). Previous operadic models of wiring diagrams use undirected wires without length, useful for modeling static systems of constraints, whereas we use directed wires with length, useful for modeling dynamic flows of information. We give multiple examples throughout to ground the ideas.
 Publication:

arXiv eprints
 Pub Date:
 July 2013
 arXiv:
 arXiv:1307.6894
 Bibcode:
 2013arXiv1307.6894R
 Keywords:

 Mathematics  Category Theory;
 Computer Science  Programming Languages;
 Quantitative Biology  Neurons and Cognition;
 08A70;
 18B20;
 18D50;
 68Q05;
 91B74;
 92B20;
 93A13;
 B.5.2;
 B.7.2;
 C.0;
 C.1;
 D.2.2;
 D.2.6;
 D.3.3;
 F.1.1;
 F.4.3