The Complexity of Reversal-Bounded Model-Checking

Marcello M Bersani (1) , Stéphane Demri (1, 2)

1 LSV - Laboratoire Spécification et Vérification
2 CNRS - Centre National de la Recherche Scientifique

We study model-checking problems on counter systems when guards are quantifier-free Presburger formulae, the specification languages are LTL-like dialects with arithmetical constraints and the runs are restricted to reversal-bounded ones. We introduce a generalization of reversal-boundedness and we show the NExpTime-completeness of the reversal-bounded model-checking problem as well as for related reversalbounded reachability problems. As a by-product, we show the effective Presburger definability for sets of configurations for which there is a reversal-bounded run verifying a given temporal formula. Our results generalize existing results about reversal-bounded counter automata and provides a uniform and more general framework

Mots clés: counter machine; reversal-boundedness; Presburger arithmetic; temporal logic; complexity; linear-time temporal logic LTL; model-checking

Domaines: Informatique [cs]; Logique en informatique [cs.LO]

Marcello M Bersani, Stéphane Demri. The Complexity of Reversal-Bounded Model-Checking. 8th International Symposium on Frontiers of Combining Systems (FroCoS'11), Viorica Sofronie-Stokkermans; Cesare Tinelli, Oct 2011, Saarbruecken, Germany. pp.71-86, ⟨10.1007/978-3-642-24364-6_6⟩. ⟨hal-03195045⟩