Model Checking Flat Freeze LTL on One-Counter Automata

Richard Mayr, Antonia Lechner, Joël Ouaknine, Amaury Pouly, James Worrell

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationProceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016)
EditorsJosée Desharnais, Radha Jagadeesan
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
Number of pages14
ISBN (Electronic)978-3-95977-017-0
Publication statusPublished - 26 Aug 2016
Event27th International Conference on Concurrency Theory - Québec City, Canada
Duration: 23 Aug 201626 Aug 2016

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik
ISSN (Print)1868-896


Conference27th International Conference on Concurrency Theory
Abbreviated titleCONCUR 2016
CityQuébec City
Internet address


  • Formal Languages and Automata Theory


Dive into the research topics of 'Model Checking Flat Freeze LTL on One-Counter Automata'. Together they form a unique fingerprint.

Cite this