@inproceedings{cfaa79c380c748fd8b9dc0671851c9b4,
title = "Model checking flat freeze LTL on one-counter automata",
abstract = "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.",
keywords = "Disequality tests, Freeze LTL, One-counter automata, Presburger arithmetic, Reachability",
author = "Antonia Lechner and Richard Mayr and Jo{\"e}l Ouaknine and Amaury Pouly and James Worrell",
note = "Publisher Copyright: {\textcopyright} Antonia Lechner, Richard Mayr, Jo{\"e}l Ouaknine, Amaury Pouly, and James Worrell; licensed under Creative Commons License CC-BY.; 27th International Conference on Concurrency Theory, CONCUR 2016 ; Conference date: 23-08-2016 Through 26-08-2016",
year = "2016",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.CONCUR.2016.29",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Josee Desharnais and Radha Jagadeesan",
booktitle = "27th International Conference on Concurrency Theory, CONCUR 2016",
}