A carregar...

Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning

We characterize the class of nondeterministic [Formula: see text]-automata that can be used for the analysis of finite Markov decision processes (MDPs). We call these automata ‘good-for-MDPs’ (GFM). We show that GFM automata are closed under classic simulation as well as under more powerful simulati...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Publicado no:Tools and Algorithms for the Construction and Analysis of Systems
Main Authors: Hahn, Ernst Moritz, Perez, Mateo, Schewe, Sven, Somenzi, Fabio, Trivedi, Ashutosh, Wojtczak, Dominik
Formato: Artigo
Idioma:Inglês
Publicado em: 2020
Assuntos:
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC7439745/
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45190-5_17
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!