Flat Parametric Counter Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Flat Parametric Counter Automata

Marius Bozga
Radu Iosif
  • Fonction : Auteur
Yassine Lakhnech
  • Fonction : Auteur

Résumé

In this paper we study the reachability problem for parametric flat counter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between non-parametric flat counter au-tomata and Presburger arithmetic has been established previously by Comon and Jurski [5]. We simplify their proof by introducing finite state automata defined over alphabets of a special kind of graphs (zigzags). This framework allows one to express also the reachability problem for parametric automata with one control loop as the existence of solutions of a 1-parametric linear Diophantine systems. The latter problem is shown to be decidable, using a number-theoretic argument. Finally, the general reachability problem for parametric flat counter automata with more than one loops is shown to be undecidable, by reduction from Hilbert's Tenth Problem [9].
Fichier principal
Vignette du fichier
Icalp06.pdf (273.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01418920 , version 1 (17-12-2016)

Identifiants

Citer

Marius Bozga, Radu Iosif, Yassine Lakhnech. Flat Parametric Counter Automata. 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), Jul 2006, Venise, Italy. pp.577-588, ⟨10.1007/11787006_49⟩. ⟨hal-01418920⟩
82 Consultations
80 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More