The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes

Stéphane Le Roux 0001, Guillermo A. Pérez. The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. In Christel Baier, Ugo Dal Lago, editors, Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings. Volume 10803 of Lecture Notes in Computer Science, pages 367-383, Springer, 2018. [doi]

Abstract

Abstract is missing.