2 search results - page 1 / 1 » Reachability in Succinct and Parametric One-Counter Automata |
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...