arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.12992cs.LO
收藏

二维约束循环问题是可判定的

The 2-Dimensional Constraint Loop Problem is Decidable

Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell

AI总结:

本文证明二维实数域上由线性约束合取定义的循环终止(等价于相应二元关系的良基性)问题可判定。

摘要:

线性约束循环由一个线性不等式系统指定,这些不等式定义了循环体单次执行前后程序变量值之间的关系。本文研究确定此类循环是否终止的问题,即无论循环如何初始化、循环体中的非确定性如何消解,是否所有极大执行都是有限的。我们关注循环变量取值于 $\mathbb{R}$ 的终止问题变体。主要结果是:实数上的终止问题在维度 2 下是可判定的。对该主要结果更抽象的表述是:判定一个以线性约束合取式给出的 $\mathbb{R}^2$ 上二元关系是否具有良基性,是可判定的。

英文摘要:

A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of determining whether such a loop terminates, i.e., whether all maximal executions are finite, regardless of how the loop is initialised and how the non-determinism in the loop body is resolved. We focus on the variant of the termination problem in which the loop variables range over $\mathbb{R}$. Our main result is that the termination problem is decidable over the reals in dimension~2. A more abstract formulation of our main result is that it is decidable whether a binary relation on $\mathbb{R}^2$ that is given as a conjunction of linear constraints is well-founded.

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

↑