Model Checking Succinct and Parametric One-Counter Automata.
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 additive updates are encoded in binary, as well as parametric one-counter automata, in which additive updates may be giv...
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Journal article |
Language: | English |
Published: |
Springer
2010
|