Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
From MaRDI portal
Publication:5039514
DOI10.1007/978-3-030-45190-5_17OpenAlexW3021883687MaRDI QIDQ5039514
Mateo Perez, Sven Schewe, Ashutosh Trivedi, Dominik Wojtczak, Ernst Moritz Hahn, Fabio Somenzi
Publication date: 13 October 2022
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.05081
Related Items (6)
Determinization and limit-determinization of Emerson-Lei automata ⋮ On the power of finite ambiguity in Büchi complementation ⋮ On history-deterministic one-counter nets ⋮ An impossibility result in automata-theoretic reinforcement learning ⋮ Alternating good-for-MDPs automata ⋮ Model-Free Reinforcement Learning for Stochastic Parity Games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair simulation
- LTL to Büchi Automata Translation: Fast and More Deterministic
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Determinising Parity Automata
- State of B\"uchi Complementation
- Optimal Translation of LTL to Limit Deterministic Automata
- Solving Games Without Determinization
- The complexity of probabilistic verification
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Lazy probabilistic model checking without determinisation
- Are Good-for-Games Automata Good for Probabilistic Model Checking?
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Owl: a library for \(\omega \)-words, automata, and LTL
This page was built for publication: Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
