Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic

Résumé

We show that model-checking flat counter systems over CTL* (with arithmetical constraints on counter values) has the same complexity as the satisfiability problem for Presburger arithmetic. The lower bound already holds with the temporal operator EF only, no~arithmetical constraints in the logical language and with guards on transitions made of simple linear constraints. This complements our understanding of model-checking flat counter systems with linear-time temporal logics, such as LTL for which the problem is already known to be (only) NP-complete with guards restricted to the linear fragment.
Fichier principal
Vignette du fichier
DDS-rp14.pdf (564.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03201531 , version 1 (19-04-2021)

Identifiants

Citer

Stéphane Demri, Amit K Kumar Dhar, Arnaud Sangnier. Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. Reachability Problems - 8th International Workshop, RP 2014, Oxford, Joël Ouaknine; Igor Potapov; James Worrell, Sep 2014, Oxford, United Kingdom. pp.85-97, ⟨10.1007/978-3-319-11439-2_7⟩. ⟨hal-03201531⟩

Collections

UNIV-PARIS7 CNRS
22 Consultations
34 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More