Model Checking Freeze LTL over One-Counter Automata

  title={Model Checking Freeze LTL over One-Counter Automata},
  author={St{\'e}phane Demri and Ranko Lazic and Arnaud Sangnier},
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automa ta. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of re gisters and on the use of propositional variables for control locations). The log ic has the ability to store a counter value and to test it later against the current counter valu . By introducing a non… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 38 references


S. Demri, R. Lazi
LTL with the freeze quantifier and register automata. In LICS’06, pages 17–26. IEEE, • 2006
View 9 Excerpts
Highly Influenced

c, and D

S. Demri, R. Lazí
Nowak. On the freeze quantifier in constraint LTL: decidability and complexity.I & C , 205(1):2–24, • 2007
View 4 Excerpts
Highly Influenced

Model Checking a Path

View 3 Excerpts
Highly Influenced

c, and A

S. Demri, R. Lazí
Sangnier. Model checking freeze LTL over one-counter a utomata. Research report, Laboratoire Spécification et Vérification, ENS Cacha n, • 2008
View 1 Excerpt

Alternation-free modal mu-calculus for data trees

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) • 2007

and J

J. Ouaknin
Worrell. On the decidability and complexity of metric te mporal logic over finite words.Logical Methods in Computer Science , 3(1:8):1–27, • 2007
View 1 Excerpt

nski and R

M. Jurdzí
Lazí c. Alternation-free modal mu-calculus for data trees. In LICS’07, pages 131–140, • 2007

Similar Papers

Loading similar papers…