@InProceedings{larsen:LIPIcs.CONCUR.2019.2,
author = {Larsen, Kim G.},
title = {{Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {2:1--2:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.2},
URN = {urn:nbn:de:0030-drops-109048},
doi = {10.4230/LIPIcs.CONCUR.2019.2},
annote = {Keywords: Timed automata, Stochastic hybrid grame, Symbolic synthesis, Reinforcement learning, Q-learning, M-learning}
}