An automated sub-exponential algorithm computes winning strategies and ranking certificate witnesses for polynomial reachability games on infinite-state real-variable graphs.
Synthesis of Linear Ranking Functions , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 2roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Automated Approach for Solving Infinite-state Polynomial Reachability Games
An automated sub-exponential algorithm computes winning strategies and ranking certificate witnesses for polynomial reachability games on infinite-state real-variable graphs.
- Complete $\omega$-Regular Supermartingale Certificates