12 search results - page 1 / 3 » On the freeze quantifier in Constraint LTL: decidability and... |
CORR
2006
Springer
13 years 11 months ago
2006
Springer
FOSSACS
2008
Springer
14 years 11 days ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
JANCL
2006
13 years 10 months ago
2006
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
CADE
2012
Springer
12 years 1 months ago
2012
Springer
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 c...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...