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 – which we refer to as the succinct encoding. It is easily seen that the reachability problem for this class of machines is...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2009
|