arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.12905math.CT
收藏

网络的合成行为

Composing Behaviors of Networks

Jade Master

摘要:

本论文旨在发展一个网路操作语意的合成理论。所考虑的网络被描述的内部或丰富的图形。在内部情况下,我们专注于$\mathsf{Q}$网,一个推广的Petri网的基础上的Lawvere理论$\mathsf{Q}$。$\mathsf{Q}$ -网包括Petri网的许多已知变体,包括预网、整数网、基本网系统和有界网。在丰富的情况下,我们专注于图丰富的quantale $R$被视为矩阵的条目在$R$。这些$R$ -矩阵表示距离网络、马尔可夫过程、容量网络、非确定性有限自动机、单图等。$\mathsf{Q}$ -网的操作语义被构造为$\mathsf{Q}$ -网和$\mathsf{Q}$的模型范畴内部的范畴之间的附接。类似地,$R$ -矩阵的操作语义被构造为$R$ -矩阵与富含$R$的范畴之间的附接。这个附加的左伴随将$R$ -矩阵$M$发送到$R$ -范畴$F_R(M)$,其hom-object是代数路径问题的解:最短路问题到在$R$中加权的图的推广。对于$\mathsf{Q}$ -网和$R$ -矩阵,我们使用结构余跨度理论来研究上述操作语义的组合性。对于每种类型的网络,我们构造一个双范畴,其态射是“开网络”,即具有指定为输入或输出的某些顶点的网络。我们介绍了一个开放网络的黑盒,一个profunctor描述外部可观察的行为的开放网络。我们介绍了一类开放网络称为“功能开放网络”,黑盒保持组成。

英文摘要:

This thesis aims to develop a compositional theory for the operational semantics of networks. The networks considered are described by either internal or enriched graphs. In the internal case we focus on $\mathsf{Q}$-nets, a generalization of Petri nets based on a Lawvere theory $\mathsf{Q}$. $\mathsf{Q}$-nets include many known variants of Petri nets including pre-nets, integer nets, elementary net systems, and bounded nets. In the enriched case we focus on graphs enriched in a quantale $R$ regarded as matrices with entries in $R$. These $R$-matrices represent distance networks, Markov processes, capacity networks, non-deterministic finite automata, simple graphs, and more. The operational semantics of $\mathsf{Q}$-nets is constructed as an adjunction between $\mathsf{Q}$-nets and categories internal to the category of models of $\mathsf{Q}$. Similarly, the operational semantics of $R$-matrices is constructed as an adjunction between $R$-matrices and categories enriched in $R$. The left adjoint of this adjunction sends an $R$-matrix $M$ to the $R$-category $F_R(M)$ whose hom-objects are solutions of the algebraic path problem: a generalization of the shortest path problem to graphs weighted in $R$. For both $\mathsf{Q}$-nets and $R$-matrices we use the theory of structured cospans to study the compositionality of the above operational semantics. For each type of network we construct a double category whose morphisms are "open networks", i.e. networks with certain vertices designated as input or output. We introduce the black-boxing of an open network, a profunctor describing the externally observable behavior of an open network. We introduce a class of open networks called "functional open networks" for which black-boxing preserves composition.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑