Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes-Reference-Cited by-同舟云学术

Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes

Published:2018 Issue: Volume: Page:322-335
ISSN:0302-9743
Container-title:Leveraging Applications of Formal Methods, Verification and Validation. Verification
language:
Short-container-title:

Author:

Ashok Pranav,Brázdil Tomáš,Křetínský Jan,Slámečka Ondřej

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-03421-4_21

Reference30 articles.

1. Ashok, P., Brázdil, T., Křetínský, J., Slámečka, O.: Monte Carlo tree search for verifying reachability in Markov decision processes. CoRR abs/1809.03299 (2018)

2. Lecture Notes in Computer Science;P Ashok,2017

3. Abramson, B., Korf, R.E.: A model of two-player evaluation functions. In: Proceedings of the 6th National Conference on Artificial Intelligence (AAAI 1987), pp. 90–94. Morgan Kaufmann (1987)

4. Lecture Notes in Computer Science;T Brázdil,2014

5. Bellman, R.: A Markovian decision process. 6:15 (1957)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Modest Approach to Markov Automata;ACM Transactions on Modeling and Computer Simulation;2021-07-31

2. A Modest Approach to Dynamic Heuristic Search in Probabilistic Model Checking;Quantitative Evaluation of Systems;2021

3. Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes;Leveraging Applications of Formal Methods, Verification and Validation. Verification;2018

4. Statistical Model Checking the 2018 Edition!;Leveraging Applications of Formal Methods, Verification and Validation. Verification;2018