The Well Structured Problem for Presburger Counter Machines

Alain Finkel (1) , Ekanshdeep Gupta (2)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 Chennai Mathematical Institute [Inde]

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: Well structured transition systems; infinite state systems; Presburger counter machines; reachability; coverability; well structured problem

Domaines: Informatique et langage [cs.CL]; Logique en informatique [cs.LO]; Théorie et langage formel [cs.FL]

Alain Finkel, Ekanshdeep Gupta. The Well Structured Problem for Presburger Counter Machines. 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), Arkadev Chattopadhyay; Paul Gastin, Dec 2019, Mumbai, India. ⟨hal-02305639⟩