Taming past LTL and flat counter systems

DOI10.1007/978-3-642-31365-3_16zbMATH Open1358.68186arXiv1205.6584OpenAlexW2162230135MaRDI QIDQ2908489FDOQ2908489

Authors: Stéphane Demri, A. K. Dhar, Arnaud Sangnier 

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Abstract: Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known complexity upper bound for the latter problem is made of a tower of several exponentials. Herein, we show that the problem is only NP-complete even if LTL admits past-time operators and arithmetical constraints on counters. Actually, the NP upper bound is shown by adequately combining a new stuttering theorem for Past LTL and the property of small integer solutions for quantifier-free Presburger formulae. Other complexity results are proved, for instance for restricted classes of flat counter systems.

Full work available at URL: https://arxiv.org/abs/1205.6584

Recommendations

• Taming past LTL and flat counter systems
• Equivalence between model-checking flat counter systems and Presburger arithmetic
• How hard is it to verify flat affine counter systems with the finite monoid property?
• Equivalence between model-checking flat counter systems and Presburger arithmetic
• On the Complexity of Verifying Regular Properties on Flat Counter Systems,

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cited In (10)

• Safely Freezing LTL
• How hard is it to verify flat affine counter systems with the finite monoid property?
• Equivalence between model-checking flat counter systems and Presburger arithmetic
• Title not available (Why is that?)
• Equivalence between model-checking flat counter systems and Presburger arithmetic
• Interprocedural reachability for flat integer programs
• On selective unboundedness of VASS
• Taming past LTL and flat counter systems
• Towards a Model-Checker for Counter Systems
• LTL Can Be More Succinct

Uses Software

• FLATA

This page was built for publication: Taming past LTL and flat counter systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908489)