Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Efficient construction of semilinear representations of languages accepted by unary NFA
RP'10 Proceedings of the 4th international conference on Reachability problems
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
When model-checking freeze LTL over counter machines becomes decidable
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Branching-Time model checking of parametric one-counter automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
Decidability of Weak Simulation on One-Counter Nets
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |
One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems over one-counter processes: model checking with the temporal logic EF, where formulas are given as directed acyclic graphs, and weak bisimilarity checking against finite systems. We show that both problems are $\P^\NP$-complete. This is achieved by establishing a close correspondence with the membership problem for a natural fragment of Presburger Arithmetic, which we show to be$\P^\NP$-complete. This fragment is also a suitable representation for the global versions of the problems. We also show that there already exists a fixed EF formula(resp. a fixed finite system) such that model checking (resp. weak bisimulation) over one-counter processes is hard for $\P^{\NP[\log]}$. However, the complexity drops to $\P$ if the one-counter process is fixed.