arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.01941cs.FLcs.ITmath.IT
收藏

时间自动机的带宽:3个类别

Bandwidth of Timed Automata: 3 Classes

Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclan

AI总结:

本研究针对时间自动机语言的带宽渐近特性,提出两个结构准则将其划分为O(1)、Θ(log(1/ε))、Θ(1/ε)三类,证明无中间类别且分类问题为PSPACE完全,证明基于Simon因子分解森林定理。

摘要:

时间语言包含由实值延迟分隔的离散事件(“字母”)序列,可被时间自动机识别,代表各类实时系统的行为。此前论文中定义的时间语言带宽概念,表征了以某一精度ε观测到的语言字中编码的单位时间信息量。\n 本文根据时间自动机对应语言的带宽关于该精度ε的渐近特性,将其划分为三类:贫乏(meager)自动机,带宽为O(1);普通(normal)自动机,带宽为Θ(log (1/ε));肥胖(obese)自动机,带宽为Θ(1/ε)。我们定义了两个结构准则,并证明它们可将时间自动机划分为这三个带宽类别,说明不存在中间渐近类别。时间自动机的分类问题是PSPACE完全的。\n 两个准则均通过从时间自动机路径到扩展Puri轨道图的有限幺半群的态射来表述;证明基于Simon因子分解森林定理。

英文摘要:

Timed languages contain sequences of discrete events ("letters'') separated by real-valued delays, they can be recognized by timed automata, and represent behaviors of various real-time systems. The notion of bandwidth of a timed language defined in a previous paper characterizes the amount of information per time unit, encoded in words of the language observed with some precision ε. In this paper, we identify three classes of timed automata according to the asymptotics of the bandwidth of their languages with respect to this precision ε: automata are either meager, with an O(1) bandwidth, normal, with a Θ(log (1/ε)) bandwidth, or obese, with Θ(1/ε) bandwidth. We define two structural criteria and prove that they partition timed automata into these three classes of bandwidth, implying that there are no intermediate asymptotic classes. The classification problem of a timed automaton is PSPACE-complete. Both criteria are formulated using morphisms from paths of the timed automaton to some finite monoids extending Puri's orbit graphs; the proofs are based on Simon's factorization forest theorem.

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

↑