Model Checking Freeze LTL over One-Counter Automata

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. ducing a non-trivial 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-c...

• Type: Conference
• Year: 2008
• Where: FOSSACS
• Authors: Stéphane Demri, Ranko Lazic, Arnaud Sangnier
• Keywords: Counter Values, FOSSACS 2008, Model Checking Ltl, One-counter Automata, Software Engineering