A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Model Checking Freeze LTL over One-Counter Automata
[chapter]
Foundations of Software Science and Computational Structures
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 automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of registers and on the use of propositional variables for control locations). The logic has the ability to store a counter value and to test it later against the current counter value. By introducing a
doi:10.1007/978-3-540-78499-9_34
dblp:conf/fossacs/DemriLS08
fatcat:7mmtnnmyzbcfppd2vidp6fxqb4