arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.03791cs.FLmath.AT
收藏

高维自动机的 Kleene 定理

Kleene Theorem for Higher-Dimensional Automata

Uli Fahrenberg, Christian Johansen, Georg Struth, Krzysztof Ziemiański

AI总结:

本文证明了高维自动机的 Kleene 定理:其识别语言恰为有限区间偏序集的理性包含闭集,通过引入带接口的自动机及代数拓扑工具完成证明,为并发模型提供通用模板。

摘要:

我们证明了高维自动机的 Kleene 定理。该定理指出,它们所识别的语言恰好是有限区间偏序集的理性包含闭集。这些语言上的理性运算包括一种粘合复合,为此我们为偏序集配备了接口。在证明中,我们引入了带接口的高维自动机,将其建模为标记预立方体范畴上的预层,并发展了受代数拓扑启发的工具和技术,如柱体和(余)纤维化。高维自动机构成了非交错并发的一般模型,它涵盖了众多其他方法。区间序被用作并发和分布式系统的模型,其中事件在时间上延伸。我们的工具和技术因此可能为各种模型和应用中的 Kleene 定理提供模板。

英文摘要:

We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets. The rational operations on these languages include a gluing composition, for which we equip pomsets with interfaces. For our proof, we introduce higher-dimensional automata with interfaces, which are modelled as presheaves over labelled precube categories, and develop tools and techniques inspired by algebraic topology, such as cylinders and (co)fibrations. Higher-dimensional automata form a general model of non-interleaving concurrency, which subsumes many other approaches. Interval orders are used as models for concurrent and distributed systems where events extend in time. Our tools and techniques may therefore yield templates for Kleene theorems in various models and applications.

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

↑