On the Complexity of Verifying Regular Properties on Flat Counter Systems, - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

On the Complexity of Verifying Regular Properties on Flat Counter Systems,

Résumé

Among the approximation methods for the verification of counter systems, one of them consists in model-checking their flat unfoldings. Unfortunately, the complexity characterization of model-checking problems for such operational models is not always well studied except for reachability queries or for Past LTL. In this paper, we characterize the complexity of model-checking problems on flat counter systems for the specification languages including first-order logic, linear mu-calculus, infinite automata, and related formalisms. Our results span different complexity classes (mainly from PTime to PSpace) and they apply to languages in which arithmetical constraints on counter values are systematically allowed. As far as the proof techniques are concerned, we provide a uniform approach that focuses on the main issues.
Fichier principal
Vignette du fichier
DDS-icalp13.pdf (718.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

Stéphane Demri, Amit K Kumar Dhar, Arnaud Sangnier. On the Complexity of Verifying Regular Properties on Flat Counter Systems,. Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013,, Jul 2013, Riga, Latvia. pp.162-173, ⟨10.1007/978-3-642-39212-2_17⟩. ⟨hal-03201533⟩

Collections

UNIV-PARIS7 CNRS
27 Consultations
26 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More