Model-Checking CTL* over Flat Presburger Counter Systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Applied Non-Classical Logics Année : 2010

Model-Checking CTL* over Flat Presburger Counter Systems

Résumé

This paper studies model-checking of fragments and extensions of CTL* on infinitestate counter systems, where the states are vectors of integers and the transitions are determined by means of relations definable within Presburger arithmetic. In general, reachability properties of counter systems are undecidable, but we have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL* can be simulated by quantification over tuples of natural numbers, eventually allowing translation of the whole Presburger-CTL* into Presburger arithmetic, thereby enabling effective model checking. We provide evidence that our results are close to optimal with respect to the class of counter systems described above.
Fichier principal
Vignette du fichier
DFGD-jancl10.pdf (262.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03191246 , version 1 (07-04-2021)

Identifiants

Citer

Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen. Model-Checking CTL* over Flat Presburger Counter Systems. Journal of Applied Non-Classical Logics, 2010, 20 (4), pp.313-344. ⟨10.3166/jancl.20.313-344⟩. ⟨hal-03191246⟩
36 Consultations
47 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More