License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2017.33
URN: urn:nbn:de:0030-drops-77993
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7799/
Go to the corresponding LIPIcs Volume Portal


Bollig, Benedikt ; Quaas, Karin ; Sangnier, Arnaud

The Complexity of Flat Freeze LTL

pdf-format:
LIPIcs-CONCUR-2017-33.pdf (0.6 MB)


Abstract

We consider the model-checking problem for freeze LTL on one-counter automata (OCAs). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter values of a run in registers so that they can be compared with one another. As the model-checking problem is undecidable in general, we focus on the flat fragment of freeze LTL, in which the usage of the freeze quantifier is restricted. Recently, Lechner et al. showed that model checking for flat freeze LTL on OCAs with binary encoding of counter updates is decidable and in 2NEXPTIME. In this paper, we prove that the problem is, in fact, NEXPTIME-complete no matter whether counter updates are encoded in unary or binary. Like Lechner et al., we rely on a reduction to the reachability problem in OCAs with parameterized tests (OCAPs). The new aspect is that we simulate OCAPs by alternating two-way automata over words. This implies an exponential upper bound on the parameter values that we exploit towards an NP algorithm for reachability in OCAPs with unary updates. We obtain our main result as a corollary.

BibTeX - Entry

@InProceedings{bollig_et_al:LIPIcs:2017:7799,
  author =	{Benedikt Bollig and Karin Quaas and Arnaud Sangnier},
  title =	{{The Complexity of Flat Freeze LTL}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{33:1--33:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7799},
  URN =		{urn:nbn:de:0030-drops-77993},
  doi =		{10.4230/LIPIcs.CONCUR.2017.33},
  annote =	{Keywords: one-counter automata, freeze LTL, model checking}
}

Keywords: one-counter automata, freeze LTL, model checking
Seminar: 28th International Conference on Concurrency Theory (CONCUR 2017)
Issue Date: 2017
Date of publication: 25.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI