Model checking flat freeze LTL on one-counter automata

Conference item

Freeze LTL is a temporal logic with registers that is suitable for specifying properties of data words. In this paper we study the model checking problem for Freeze LTL on one-counter automata. This problem is known to be undecidable in full generality and PSPACE-complete for the special case of deterministic one-counter automata. Several years ago, Demri and Sangnier investigated the model checking problem for the flat fragment of Freeze LTL on several classes of counter automata and posed the decidability of model checking flat Freeze LTL on one-counter automata as an open problem. In this paper we resolve this problem positively, utilising a known reduction to a reachability problem on one-counter automata with parameterised equality and disequality tests. Our main technical contribution is to show decidability of the latter problem by translation to Presburger arithmetic.

Authors: Lechner, A; Mayr, R; Ouaknine, J; Pouly, A; Worrell, J

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Schloss Dagstuhl – Leibniz Center for Informatics
• Host title: 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016)
• Journal: 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016)
• Publication date: 2016-08-01
• Acceptance date: 2016-04-15
• DOI: 10.4230/LIPIcs.CONCUR.2016.29
• ISSN: 1868-8969
• Keywords: One-counter automata; reachability; disequality tests; freeze LTL; Presburger arithmetic