Qualitative Analysis of $ω$-Regular Objectives on Robust MDPs

Documenti analoghi

• Solving Long-run Average Reward Robust MDPs via Stochastic Games
  di: Chatterjee, Krishnendu, et al.
  Pubblicazione: (2023)
• Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
  di: Asadi, Ali, et al.
  Pubblicazione: (2026)
• Automated Approach for Solving Infinite-state Polynomial Reachability Games
  di: Chatterjee, Krishnendu, et al.
  Pubblicazione: (2026)
• Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
  di: Chatterjee, Krishnendu, et al.
  Pubblicazione: (2024)
• Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
  di: Chatterjee, Krishnendu, et al.
  Pubblicazione: (2024)