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...
| Autores principales: | , , , |
|---|---|
| Otros Autores: | |
| Formato: | Journal article |
| Lenguaje: | English |
| Publicado: |
Springer
2010
|