The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
An automata-theoretic approach to constraint LTL
Information and Computation
The Effects of Bounding Syntactic Resources on Presburger LTL
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Bounded Reachability for Temporal Logic over Constraint Systems
TIME '10 Proceedings of the 2010 17th International Symposium on Temporal Representation and Reasoning
Hi-index | 0.00 |
We show that the satisfiability problem for LTL (with past operators) over arithmetic constraints (Constraint LTL) can be answered by solving a finite amount of instances of bounded satisfiability problems when atomic formulae belong to certain suitable fragments of Presburger arithmetic. A formula is boundedly satisfiable when it admits an ultimately periodic model of the form δπω, where δ and π are finite sequences of symbolic valuations. Therefore, for every formula there exists a completeness bound c, such that, if there is no ultimately periodic model with |δπ| ≤ c, then the formula is unsatisfiable.