The Well Structured Problem for Presburger Counter Machines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

The Well Structured Problem for Presburger Counter Machines

Alain Finkel
Ekanshdeep Gupta
  • Fonction : Auteur
  • PersonId : 1055436

Résumé

We introduce the well structured problem as the question of whether a model (here a counter machine) is well structured (here for the usual ordering on integers). We show that it is undecidable for most of the (Presburger-defined) counter machines except for Affine VASS of dimension one. However, the strong well structured problem is decidable for all Presburger counter machines. While Affine VASS of dimension one are not, in general, well structured, we give an algorithm that computes the set of predecessors of a configuration; as a consequence this allows to decide the well structured problem for 1-Affine VASS.

Mots clés

Fichier non déposé

Dates et versions

hal-04285406 , version 1 (14-11-2023)

Identifiants

Citer

Alain Finkel, Ekanshdeep Gupta. The Well Structured Problem for Presburger Counter Machines. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.41⟩. ⟨hal-04285406⟩
11 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More