Branching-time model checking of parametric one-counter automata
We study the computational complexity of model checking EF logic and modal logic on parametric one-counter automata (POCA). A POCA is a one-counter automaton whose counter updates are either integer values encoded in binary or integer-valued parameters. Given a formula and a configuration of a POCA,...
Main Authors: | , , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2012
|
Search Result 1