The 2-Dimensional Constraint Loop Problem Is Decidable - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

The 2-Dimensional Constraint Loop Problem Is Decidable

Résumé

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 ℝ. 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 ℝ² that is given as a conjunction of linear constraints is well-founded.
Fichier principal
Vignette du fichier
LIPIcs.ICALP.2024.140.pdf (951.5 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04644417 , version 1 (11-07-2024)

Licence

Identifiants

Citer

Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell. The 2-Dimensional Constraint Loop Problem Is Decidable. 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Tallinn University of Technology, Jul 2024, Tallin, Estonia. pp.21, ⟨10.4230/LIPIcs.ICALP.2024.140⟩. ⟨hal-04644417⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More