Model-checking stateless quantum pushdown systems against PCTL is undecidable while against bPCTL it is decidable and NP-hard.
[Hir04] Mika Hirvensalo
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
Formalizes PCTL on MJLSs to specify and check moment-based stability properties for prescribed initial state sets using linear-algebraic techniques.
The paper formalizes a hybrid quantum-classical architectural style and demonstrates a method that identifies decision boundaries for selecting configurations based on user QoS criteria.
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
-
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.