Sciweavers

CONCUR
2009
Springer
13 years 11 months ago
Reachability in Succinct and Parametric One-Counter Automata
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—...
Christoph Haase, Stephan Kreutzer, Joël Ouakn...