23 citations · 85 across the 23 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.FL2016
The Complexity of Flat Freeze LTL
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
We consider the model-checking problem for freeze LTL on one-counter automata (OCA). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter…
cs.FL2016
One-Counter Automata with Counter Observability
Benedikt Bollig
In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold.…