Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
[Hir04] Mika Hirvensalo
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
Presents hierarchical adaptive refinement to accelerate near-optimal policy synthesis in MDPs up to 1M states with up to 2x speedup over PRISM and formal error bounds.
citing papers explorer
-
Computational Complexity of Model-Checking Quantum Pushdown Systems
Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
-
Accelerating Policy Synthesis in Large-Scale MDPs via Hierarchical Adaptive Refinement
Presents hierarchical adaptive refinement to accelerate near-optimal policy synthesis in MDPs up to 1M states with up to 2x speedup over PRISM and formal error bounds.