Model Checking Freeze LTL over One-Counter Automata [chapter]

Stéphane Demri, Ranko Lazić, Arnaud Sangnier
Foundations of Software Science and Computational Structures  
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of registers and on the use of propositional variables for control locations). The logic has the ability to store a counter value and to test it later against the current counter value. By introducing a
more » ... vial abstraction on counter values, we show that model checking LTL with registers over deterministic one-counter automata is PSPACEcomplete with infinite accepting runs. By constrast, we prove that model checking LTL with registers over nondeterministic one-counter automata is Σ 1 1 -complete [resp. Σ 0 1 -complete] in the infinitary [resp. finitary] case even if only one register is used and with no propositional variable. This makes a difference with the facts that several verification problems for one-counter automata are known to be decidable with relatively low complexity, and that finitary satisfiability for LTL with a unique register is decidable. Our results pave the way for model-checking LTL with registers over other classes of operational models, such as reversal-bounded counter machines and deterministic pushdown systems.
doi:10.1007/978-3-540-78499-9_34 dblp:conf/fossacs/DemriLS08 fatcat:7mmtnnmyzbcfppd2vidp6fxqb4