Alternating good-for-MDPs automata

DOI10.1007/978-3-031-19992-9_19zbMath1522.68270arXiv2205.03243OpenAlexW4312893362MaRDI QIDQ6160921

Fabio Somenzi, Sven Schewe, Ernst Moritz Hahn, Ashutosh Trivedi, Dominik Wojtczak, Mateo Perez

Publication date: 2 June 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.03243

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Synthesis of Reactive(1) designs
• Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
• Solving Games Without Determinization
• The complexity of probabilistic verification
• Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
• Model-Free Reinforcement Learning for Stochastic Parity Games
• Lazy probabilistic model checking without determinisation
• Omega-Regular Objectives in Model-Free Reinforcement Learning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternating good-for-MDPs automata